STACS 2001 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

49

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540416951, 9783540446934

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Star-Free Open Languages and Aperiodic Loops

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_8 ◽

2007 ◽

pp. 87-98 ◽

Cited By ~ 2

Author(s):

Martin Beaudry ◽

François Lemieux ◽

Denis Thérien3

Download Full-text

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_7 ◽

2007 ◽

pp. 75-86 ◽

Cited By ~ 17

Author(s):

Andris Ambainis1 ◽

Arnolds KĶikusts ◽

Māris Valdats

Keyword(s):

Finite Automata ◽

Quantum Finite Automata

Download Full-text

A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_47 ◽

2001 ◽

pp. 539-550 ◽

Cited By ~ 10

Author(s):

Victor L. Selivanov

Keyword(s):

Logical Approach

Download Full-text

The Complexity of Copy Constant Detection in Parallel Programs

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_43 ◽

2001 ◽

pp. 490-501

Author(s):

Markus Müller-Olm

Keyword(s):

Parallel Programs

Download Full-text

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_27 ◽

2001 ◽

pp. 305-316 ◽

Cited By ~ 2

Author(s):

Massimiliano Goldwurm ◽

Beatrice Palano ◽

Massimo Santini

Keyword(s):

Circuit Complexity ◽

Random Generation ◽

Context Free

Download Full-text

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_20 ◽

2001 ◽

pp. 230-237

Author(s):

Leah Epstein

Keyword(s):

Preemptive Scheduling ◽

Uniform Processors

Download Full-text

On Multipartition Communication Complexity

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_18 ◽

2001 ◽

pp. 206-217 ◽

Cited By ~ 4

Author(s):

Pavol Ďuriš ◽

Juraj Hromkovič ◽

Stasys Jukna ◽

Martin Sauerhoff ◽

Georg Schnitger

Keyword(s):

Communication Complexity

Download Full-text

Small PCPs with Low Query Complexity

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_29 ◽

2001 ◽

pp. 327-338

Author(s):

Prahladh Harsha ◽

Madhu Sudan

Keyword(s):

Query Complexity

Download Full-text

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_42 ◽

2001 ◽

pp. 478-489 ◽

Cited By ~ 1

Author(s):

Liang Zhao ◽

Hiroshi Nagamochi ◽

Toshihide Ibaraki

Keyword(s):

Approximation Algorithm ◽

Network Design ◽

Design Problem ◽

Network Design Problem ◽

Survivable Network Design ◽

Survivable Network ◽

Primal Dual

Download Full-text

On the Minimal Hardware Complexity of Pseudorandom Function Generators

STACS 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44693-1_37 ◽

2001 ◽

pp. 419-430 ◽

Cited By ~ 5

Author(s):

Matthias Krause ◽

Stefan Lucks

Keyword(s):

Hardware Complexity ◽

Function Generators ◽

Pseudorandom Function ◽

Minimal Hardware

Download Full-text