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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540664086, 9783540483403

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System

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

10.1007/3-540-48340-3_9 ◽

1999 ◽

pp. 92-102 ◽

Cited By ~ 3

Author(s):

Arnaud Durand ◽

Miki Hermann ◽

Laurent Juban

Keyword(s):

Hilbert Basis ◽

Diophantine System

Download Full-text

Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types

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

10.1007/3-540-48340-3_41 ◽

1999 ◽

pp. 443-453

Author(s):

Jerzy Tiuryn

Keyword(s):

Type Reconstruction

Download Full-text

Model Checking and Higher-Order Recursion

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

10.1007/3-540-48340-3_14 ◽

1999 ◽

pp. 149-159 ◽

Cited By ~ 2

Author(s):

Hardi Hungar

Keyword(s):

Model Checking ◽

Higher Order

Download Full-text

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

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

10.1007/3-540-48340-3_35 ◽

1999 ◽

pp. 387-397 ◽

Cited By ~ 4

Author(s):

Henning Fernau ◽

Rolf Niedermeier

Keyword(s):

Vertex Cover ◽

Exact Algorithm

Download Full-text

Edge Coloring of Bipartite Graphs with Constraints

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

10.1007/3-540-48340-3_34 ◽

1999 ◽

pp. 376-386 ◽

Cited By ~ 1

Author(s):

Ioannis Caragiannis ◽

Christos Kaklamanis ◽

Pino Persiano

Keyword(s):

Edge Coloring ◽

Bipartite Graphs

Download Full-text

The Complexity of Minimizing FBDDs

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

10.1007/3-540-48340-3_23 ◽

1999 ◽

pp. 251-261 ◽

Cited By ~ 2

Author(s):

Detlef Sieling

Download Full-text

On Some Topological Properties of Linear Cellular Automata

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

10.1007/3-540-48340-3_19 ◽

1999 ◽

pp. 209-219 ◽

Cited By ~ 4

Author(s):

Luciano Margara

Keyword(s):

Cellular Automata ◽

Topological Properties

Download Full-text

An Improved Disjunctive Strictness Analysis for Lazy Functional Languages

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

10.1007/3-540-48340-3_17 ◽

1999 ◽

pp. 187-197

Author(s):

Grzegorz Grudziński

Keyword(s):

Functional Languages ◽

Strictness Analysis

Download Full-text

Efficient Strongly Universal and Optimally Universal Hashing

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

10.1007/3-540-48340-3_24 ◽

1999 ◽

pp. 262-272 ◽

Cited By ~ 5

Author(s):

Philipp Woelfel

Keyword(s):

Universal Hashing

Download Full-text

The Burrows-Wheeler Transform: Theory and Practice

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

10.1007/3-540-48340-3_4 ◽

1999 ◽

pp. 34-47 ◽

Cited By ~ 10

Author(s):

Giovanni Manzini

Keyword(s):

Theory And Practice ◽

Burrows Wheeler Transform

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System

Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types

Model Checking and Higher-Order Recursion

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

Edge Coloring of Bipartite Graphs with Constraints

The Complexity of Minimizing FBDDs

On Some Topological Properties of Linear Cellular Automata

An Improved Disjunctive Strictness Analysis for Lazy Functional Languages

Efficient Strongly Universal and Optimally Universal Hashing

The Burrows-Wheeler Transform: Theory and Practice

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