Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540587156, 9783540490548

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient parallel and linear time sequential split decomposition (extended abstract)

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_123 ◽

1994 ◽

pp. 171-180 ◽

Cited By ~ 7

Author(s):

Elias Dahlhaus

Keyword(s):

Linear Time ◽

Split Decomposition

Coloring semi-random graphs in polynomial expected time

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_120 ◽

1994 ◽

pp. 137-148 ◽

Cited By ~ 1

Author(s):

C. R. Subramanian ◽

C. E. Madhavan

Keyword(s):

Random Graphs ◽

Expected Time

An epistemic foundation for logic programming with uncertainty

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_116 ◽

1994 ◽

pp. 89-100 ◽

Cited By ~ 13

Author(s):

Laks V. S. Lakshmanan

Keyword(s):

Logic Programming

Foundations for faster external sorting

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_142 ◽

1994 ◽

pp. 414-425 ◽

Cited By ~ 2

Author(s):

Vladimir Estivill-Castro ◽

Derick Wood

Keyword(s):

External Sorting

Solving a unification problem under constrained substitutions using tree automata

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_131 ◽

1994 ◽

pp. 276-287 ◽

Cited By ~ 1

Author(s):

Yuichi Kaji ◽

Toru Kasami ◽

Tom Fujiwara

Keyword(s):

Tree Automata ◽

Unification Problem

Interpreter verification for a functional language

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_115 ◽

1994 ◽

pp. 77-88 ◽

Cited By ~ 3

Author(s):

Manfred Broy ◽

Ursula Hinkel ◽

Tobias Nipkow ◽

Christian Prehofer ◽

Birgit Schieder

Keyword(s):

Functional Language

The complexity of computing over quasigroups

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_112 ◽

1994 ◽

pp. 36-47 ◽

Cited By ~ 7

Author(s):

Hervé Caussinus ◽

François Lemieux

On the interactive complexity of graph reliability

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_110 ◽

1994 ◽

pp. 12-23

Author(s):

Jean-Marc Couveignes ◽

Juan Francisco Diaz-Frias ◽

Michel Rougemont ◽

Miklos Santha

Using linear arithmetic procedure for generating induction schemes

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_144 ◽

1994 ◽

pp. 438-449 ◽

Cited By ~ 1

Author(s):

Deepak Kapur ◽

M. Subramaniam

Keyword(s):

Linear Arithmetic

Efficient algorithms for the transformation between different types of binary decision diagrams

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-58715-2_140 ◽

1994 ◽

pp. 390-401 ◽

Cited By ~ 1

Author(s):

Petr Savický ◽

Ingo Wegener

Keyword(s):

Binary Decision Diagrams ◽

Efficient Algorithms ◽

Decision Diagrams ◽

Binary Decision ◽

Different Types

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Efficient parallel and linear time sequential split decomposition (extended abstract)

Coloring semi-random graphs in polynomial expected time

An epistemic foundation for logic programming with uncertainty

Foundations for faster external sorting

Solving a unification problem under constrained substitutions using tree automata

Interpreter verification for a functional language

The complexity of computing over quasigroups

On the interactive complexity of graph reliability

Using linear arithmetic procedure for generating induction schemes

Efficient algorithms for the transformation between different types of binary decision diagrams

Lecture Notes in Computer Science - Foundation of Software Technology and Theoretical Computer Science
Latest Publications