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

TOTAL DOCUMENTS

60

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540424871, 9783540446699

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Structured Randomized Rounding and Coloring

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_53 ◽

2007 ◽

pp. 461-471 ◽

Author(s):

Benjamin Doerr

Keyword(s):

Randomized Rounding

Download Full-text

The Complexity of Maximum Matroid-Greedoid Intersection

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_60 ◽

2001 ◽

pp. 535-539

Author(s):

Taneli Mielikäinen ◽

Esko Ukkonen

Download Full-text

On Robust Algorithms for the Maximum Weight Stable Set Problem

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_51 ◽

2001 ◽

pp. 445-458 ◽

Author(s):

Andreas Brandstädt

Keyword(s):

Maximum Weight ◽

Robust Algorithms ◽

Stable Set Problem

Download Full-text

Space-Efficient 1.5-Way Quantum Turing Machine

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_37 ◽

2001 ◽

pp. 380-383

Author(s):

Andrej Dubrovsky

Keyword(s):

Turing Machine ◽

Quantum Turing Machine

Download Full-text

Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_30 ◽

2001 ◽

pp. 311-322 ◽

Author(s):

Robert Rettinger ◽

Rutger Verbeek

Keyword(s):

Monte Carlo ◽

Linear Time ◽

Truth Table ◽

Polynomial Versus

Download Full-text

Challenges of Commutation

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_3 ◽

2001 ◽

pp. 15-23 ◽

Author(s):

Juhani Karhumäki

Download Full-text

Time/Space Efficient Compressed Pattern Matching

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_15 ◽

2001 ◽

pp. 138-149 ◽

Author(s):

Leszek Gasieniec ◽

Igor Potapov

Keyword(s):

Pattern Matching ◽

Download Full-text

Modelling Change with the Aid of Knowledge and Time

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_16 ◽

2001 ◽

pp. 150-161 ◽

Author(s):

Bernhard Heinemann

Download Full-text

Ambainis-Freivalds’ Algorithm for Measure-Once Automata

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_10 ◽

2001 ◽

pp. 83-93

Author(s):

Aija Bērziņa ◽

Richard Bonner

Download Full-text

Best Increments for the Average Case of Shellsort

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-44669-9_12 ◽

2001 ◽

pp. 106-117 ◽

Author(s):

Marcin Ciura

Keyword(s):

Download Full-text