Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

45

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540615507, 9783540705970

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Polynomial time samplable distributions

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_179 ◽

1996 ◽

pp. 566-578 ◽

Author(s):

Tomoyuki Yamakami

Keyword(s):

Polynomial Time

Download Full-text

On the conjugation of Standard morphisms

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_174 ◽

1996 ◽

pp. 506-516 ◽

Author(s):

Patrice Séébold

Download Full-text

Kolmogorov complexity: Recent research in Moscow

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_145 ◽

1996 ◽

pp. 156-166 ◽

Author(s):

Vladimir A. Uspensky

Keyword(s):

Kolmogorov Complexity

Download Full-text

A sequent calculus for subtyping polymorphic types

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_144 ◽

1996 ◽

pp. 135-155

Author(s):

Jerzy Tiuryn

Keyword(s):

Sequent Calculus

Download Full-text

A modal logic for data analysis

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_146 ◽

1996 ◽

pp. 167-179 ◽

Author(s):

Philippe Balbiani

Keyword(s):

Data Analysis ◽

Download Full-text

Word level model checking

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_136 ◽

1996 ◽

pp. 1-1

Author(s):

Edmund M. Clarke

Keyword(s):

Model Checking ◽

Download Full-text

Nonmonotonic rule systems: Forward chaining, constraints, and complexity

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_142 ◽

1996 ◽

pp. 113-113

Author(s):

Jeffrey B. Remmel

Keyword(s):

Forward Chaining ◽

Download Full-text

Partial order reduction: Model-checking using representatives

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_141 ◽

1996 ◽

pp. 93-112 ◽

Author(s):

Doron Peled

Keyword(s):

Model Checking ◽

Partial Order ◽

Order Reduction ◽

Partial Order Reduction ◽

Reduction Model

Download Full-text

Approximating good simultaneous Diophantine approximations is almost NP-hard

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_173 ◽

1996 ◽

pp. 494-505 ◽

Author(s):

Carsten Rössner ◽

Jean-Pierre Seifert

Keyword(s):

Np Hard ◽

Diophantine Approximations ◽

Simultaneous Diophantine Approximations

Download Full-text

Shortest path problems with time constraints

Mathematical Foundations of Computer Science 1996 - Lecture Notes in Computer Science ◽

10.1007/3-540-61550-4_153 ◽

1996 ◽

pp. 255-266 ◽

Author(s):

X. Cai ◽

T. Kloks ◽

C. K. Wong

Keyword(s):

Shortest Path ◽

Time Constraints ◽

Shortest Path Problems

Download Full-text