Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642034084, 9783642034091

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_9 ◽

2009 ◽

pp. 84-95 ◽

Author(s):

Peter Damaschke ◽

Azam Sheikh Muhammad

Keyword(s):

Download Full-text

Energy Complexity and Depth of Threshold Circuits

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_30 ◽

2009 ◽

pp. 335-345 ◽

Author(s):

Kei Uchizawa ◽

Takao Nishizeki ◽

Eiji Takimoto

Keyword(s):

Threshold Circuits

Download Full-text

Correcting Sorted Sequences in a Single Hop Radio Network

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_21 ◽

2009 ◽

pp. 230-241

Author(s):

Marcin Kik

Keyword(s):

Download Full-text

Earliest Query Answering for Deterministic Nested Word Automata

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_12 ◽

2009 ◽

pp. 121-132 ◽

Author(s):

Olivier Gauwin ◽

Joachim Niehren ◽

Sophie Tison

Keyword(s):

Query Answering

Download Full-text

Equivalence of Deterministic Nested Word to Word Transducers

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_28 ◽

2009 ◽

pp. 310-322 ◽

Author(s):

Sławomir Staworko ◽

Grégoire Laurence ◽

Aurélien Lemay ◽

Joachim Niehren

Download Full-text

Noise-Resilient Group Testing: Limitations and Constructions

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_7 ◽

2009 ◽

pp. 62-73 ◽

Author(s):

Mahdi Cheraghchi

Keyword(s):

Download Full-text

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_29 ◽

2009 ◽

pp. 323-334 ◽

Author(s):

Thomas Thierauf ◽

Fabian Wagner

Download Full-text

Open Maps Bisimulations for Higher Dimensional Automata Models

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_25 ◽

2009 ◽

pp. 274-286 ◽

Author(s):

Elena S. Oshevskaya

Keyword(s):

Higher Dimensional ◽

Download Full-text

A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_22 ◽

2009 ◽

pp. 242-249 ◽

Author(s):

Krzysztof Krzywdziński

Keyword(s):

Unit Disc ◽

Distributed Algorithm

Download Full-text

Martingales on Trees and the Empire Chromatic Number of Random Trees

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03409-1_8 ◽

2009 ◽

pp. 74-83 ◽

Author(s):

Colin Cooper ◽

Andrew R. A. McGrae ◽

Michele Zito

Keyword(s):

Chromatic Number ◽

Download Full-text