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

TOTAL DOCUMENTS

65

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540679011, 9783540446125

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

And/Or Hierarchies and Round Abstraction

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

10.1007/3-540-44612-5_4 ◽

2007 ◽

pp. 52-63

Author(s):

1Radu Grosu

Download Full-text

Informative Labeling Schemes for Graphs

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

10.1007/3-540-44612-5_53 ◽

2000 ◽

pp. 579-588 ◽

Author(s):

David Peleg

Keyword(s):

Labeling Schemes ◽

Informative Labeling Schemes

Download Full-text

Reducing the Number of Solutions of NP Functions

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

10.1007/3-540-44612-5_35 ◽

2000 ◽

pp. 394-404 ◽

Author(s):

Lane A. Hemaspaandra ◽

Mitsunori Ogihara ◽

Gerd Wechsung

Keyword(s):

Number Of Solutions

Download Full-text

Subtractive Reductions and Complete Problems for Counting Complexity Classes

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

10.1007/3-540-44612-5_28 ◽

2000 ◽

pp. 323-332 ◽

Author(s):

Arnaud Durand ◽

Miki Hermann ◽

Phokion G. Kolaitis

Keyword(s):

Complexity Classes ◽

Counting Complexity ◽

Complete Problems

Download Full-text

Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks

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

10.1007/3-540-44612-5_27 ◽

2000 ◽

pp. 314-322

Author(s):

Stefan Dobrev

Keyword(s):

Leader Election ◽

Complete Networks

Download Full-text

Balanced k-Colorings

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

10.1007/3-540-44612-5_16 ◽

2000 ◽

pp. 202-211 ◽

Author(s):

Therese C. Biedl ◽

Eowyn Cenek ◽

Timothy M. Chan ◽

Erik D. Demaine ◽

Martin L. Demaine ◽

...

Download Full-text

Measure Theoretic Completeness Notions for the Exponential Time Classes

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

10.1007/3-540-44612-5_11 ◽

2000 ◽

pp. 152-161 ◽

Author(s):

Klaus Ambos-Spies

Keyword(s):

Exponential Time

Download Full-text

Bilinear Functions and Trees over the (max, +) Semiring

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

10.1007/3-540-44612-5_50 ◽

2000 ◽

pp. 549-558

Author(s):

Sabrina Mantaci ◽

Vincent D. Blondel ◽

Jean Mairesse

Keyword(s):

Bilinear Functions

Download Full-text

Regularity of Congruential Graphs

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

10.1007/3-540-44612-5_63 ◽

2000 ◽

pp. 680-689 ◽

Author(s):

Tanguy Urvoy

Download Full-text

A Compositional Model for Confluent Dynamic Data-Flow Networks

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

10.1007/3-540-44612-5_17 ◽

2000 ◽

pp. 212-221 ◽

Author(s):

Frank S. de Boer ◽

Marcello M. Bonsangue

Keyword(s):

Data Flow ◽

Flow Networks ◽

Dynamic Data ◽

Compositional Model

Download Full-text