Lecture Notes in Computer Science - STACS 2003
Latest Publications

TOTAL DOCUMENTS

60

(FIVE YEARS 0)

H-INDEX

12

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540006237, 9783540364948

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

How Does Computer Science Change Molecular Biology?

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_2 ◽

2010 ◽

pp. 13-13

Author(s):

Alain Viari

Keyword(s):

Molecular Biology ◽

Computer Science

Download Full-text

Approximating Geometric Bottleneck Shortest Paths

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_5 ◽

2010 ◽

pp. 38-49

Author(s):

Prosenjit Bose ◽

Anil Maheshwari ◽

Giri Narasimhan ◽

Michiel Smid ◽

Norbert Zeh

Keyword(s):

Download Full-text

Complete Classifications for the Communication Complexity of Regular Languages

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_7 ◽

2003 ◽

pp. 62-73 ◽

Author(s):

Pascal Tesson ◽

Denis Thérien

Keyword(s):

Communication Complexity ◽

Regular Languages

Download Full-text

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_60 ◽

2003 ◽

pp. 687-698 ◽

Author(s):

Véronique Bruyère ◽

Emmanuel Dall’Olio ◽

Jean-FranÇois Raskin

Keyword(s):

Model Checking ◽

Timed Automata ◽

Parametric Model ◽

Presburger Arithmetic

Download Full-text

Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_51 ◽

2003 ◽

pp. 583-595 ◽

Author(s):

Wil Michiels ◽

Jan Korst ◽

Emile Aarts ◽

Jan van Leeuwen

Keyword(s):

Partitioning Problem ◽

Number Partitioning

Download Full-text

Strong Reductions and Immunity for Exponential Time

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_49 ◽

2003 ◽

pp. 559-570

Author(s):

Marcus Schaefer ◽

Frank Stephan

Keyword(s):

Exponential Time

Download Full-text

Distributed Soft Path Coloring

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_46 ◽

2003 ◽

pp. 523-534 ◽

Author(s):

Peter Damaschke

Keyword(s):

Download Full-text

On the Difficulty of Some Shortest Path Problems

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_31 ◽

2003 ◽

pp. 343-354 ◽

Author(s):

John Hershberger ◽

Subhash Suri ◽

Amit Bhosle

Keyword(s):

Shortest Path ◽

Shortest Path Problems

Download Full-text

Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_29 ◽

2003 ◽

pp. 319-330 ◽

Author(s):

Petr Hliněný

Keyword(s):

Second Order ◽

Order Logic ◽

Parse Trees ◽

Branch Width ◽

Second Order Logic ◽

Monadic Second Order Logic

Download Full-text

Some Results on Derandomization

Lecture Notes in Computer Science - STACS 2003 ◽

10.1007/3-540-36494-3_20 ◽

2003 ◽

pp. 212-222 ◽

Author(s):

Harry Buhrman ◽

Lance Fortnow ◽

A. Pavan

Download Full-text