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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

3540133720

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Limits, higher type computability and type-free languages

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

10.1007/bfb0030292 ◽

2006 ◽

pp. 96-114

Author(s):

G. Longo

Multiprocessor systems and their concurrency

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

10.1007/bfb0030335 ◽

2006 ◽

pp. 516-525

Author(s):

Peter H. Starke

Keyword(s):

Multiprocessor Systems

Thue systems and the Church-Rosser property

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

10.1007/bfb0030291 ◽

2006 ◽

pp. 80-95 ◽

Cited By ~ 6

Author(s):

Matthias Jantzen

Keyword(s):

The Church

On the complexity of slice functions

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

10.1007/bfb0030339 ◽

2006 ◽

pp. 553-561 ◽

Cited By ~ 2

Author(s):

I. Wegener

Free constructions in algebraic institutions

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

10.1007/bfb0030336 ◽

2006 ◽

pp. 526-534 ◽

Cited By ~ 7

Author(s):

Andrzej Tarlecki

Keyword(s):

Free Constructions

On the Herbrand Kleene universe for nondeterministic computations

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

10.1007/bfb0030301 ◽

2006 ◽

pp. 214-222 ◽

Cited By ~ 2

Author(s):

Manfred Broy

Some connections between presentability of complexity classes and the power of formal systems of reasoning

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

10.1007/bfb0030318 ◽

2006 ◽

pp. 364-369 ◽

Cited By ~ 11

Author(s):

Wojciech Kowalczyk

Keyword(s):

Complexity Classes ◽

Formal Systems

Nondeterministic logspace reductions

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

10.1007/bfb0030320 ◽

2006 ◽

pp. 378-388

Author(s):

Klaus ◽

Jörn Lange

Keyword(s):

Nondeterministic Logspace

Decidability of monadic theories

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

10.1007/bfb0030296 ◽

2006 ◽

pp. 162-175 ◽

Cited By ~ 23

Author(s):

A. L. Semenov

Remarks on comparing expressive power of logics of programs

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

10.1007/bfb0030337 ◽

2006 ◽

pp. 535-543 ◽

Cited By ~ 1

Author(s):

Jerzy Tiuryn ◽

Paweł Urzyczyn

Keyword(s):

Expressive Power ◽

Logics Of Programs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

Limits, higher type computability and type-free languages

Multiprocessor systems and their concurrency

Thue systems and the Church-Rosser property

On the complexity of slice functions

Free constructions in algebraic institutions

On the Herbrand Kleene universe for nondeterministic computations

Some connections between presentability of complexity classes and the power of formal systems of reasoning

Nondeterministic logspace reductions

Decidability of monadic theories

Remarks on comparing expressive power of logics of programs

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