STACS 2002 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

53

(FIVE YEARS 0)

H-INDEX

12

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540432838, 9783540458418

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Labeling Schemes for Dynamic Tree Networks

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_5 ◽

2002 ◽

pp. 76-87 ◽

Author(s):

Amos Korman ◽

David Peleg ◽

Yoav Rodeh

Keyword(s):

Tree Networks ◽

Labeling Schemes ◽

Download Full-text

Axiomatising Tree-Interpretable Structures

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_49 ◽

2002 ◽

pp. 596-607 ◽

Author(s):

Achim Blumensath

Download Full-text

On the Enumerative Sequences of Regular Languages on k Symbols

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_45 ◽

2002 ◽

pp. 547-558

Author(s):

Béal Marie-Pierre ◽

Dominique Perrin

Keyword(s):

Regular Languages

Download Full-text

Recognizable Sets of Message Sequence Charts

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_43 ◽

2002 ◽

pp. 523-534 ◽

Author(s):

Rémi Morin

Keyword(s):

Message Sequence Charts

Download Full-text

A New Diagram from Disks in the Plane

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_19 ◽

2002 ◽

pp. 238-249 ◽

Author(s):

Joachim Giesen ◽

Matthias John

Download Full-text

Complexity of Multi-dimensional Loop Alignment

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_14 ◽

2002 ◽

pp. 179-191 ◽

Author(s):

Alain Darte ◽

Guillaume Huard

Keyword(s):

Download Full-text

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_20 ◽

2002 ◽

pp. 250-261 ◽

Author(s):

Stefan Langerman ◽

Pat Morin ◽

Michael Soss

Download Full-text

Complexity of Semi-algebraic Proofs

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_34 ◽

2002 ◽

pp. 419-430 ◽

Author(s):

Dima Grigoriev ◽

Edward A. Hirsch ◽

Dmitrii V. Pasechnik

Keyword(s):

Algebraic Proofs

Download Full-text

Improved Quantum Communication Complexity Bounds for Disjointness and Equality

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_24 ◽

2002 ◽

pp. 299-310 ◽

Author(s):

Peter Høyer ◽

Ronald de Wolf

Keyword(s):

Communication Complexity ◽

Quantum Communication ◽

Complexity Bounds ◽

Quantum Communication Complexity

Download Full-text

Bi-Immunity Separates Strong NP-Completeness Notions

STACS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45841-7_33 ◽

2002 ◽

pp. 408-418 ◽

Author(s):

A. Pavan ◽

Alan L. Selman

Keyword(s):

Np Completeness

Download Full-text