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

2007 ◽  
pp. 87-98 ◽  
Author(s):  
Martin Beaudry ◽  
François Lemieux ◽  
Denis Thérien3

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

2007 ◽  
pp. 75-86 ◽  
Author(s):  
Andris Ambainis1 ◽  
Arnolds KĶikusts ◽  
Māris Valdats
Keyword(s):  
Finite Automata ◽  
Quantum Finite Automata

The Complexity of Copy Constant Detection in Parallel Programs

2001 ◽  
pp. 490-501
Author(s):  
Markus Müller-Olm
Keyword(s):  
Parallel Programs

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

2001 ◽  
pp. 305-316 ◽  
Author(s):  
Massimiliano Goldwurm ◽  
Beatrice Palano ◽  
Massimo Santini
Keyword(s):  
Circuit Complexity ◽  
Random Generation ◽  
Context Free

On Multipartition Communication Complexity

2001 ◽  
pp. 206-217 ◽  
Author(s):  
Pavol Ďuriš ◽  
Juraj Hromkovič ◽  
Stasys Jukna ◽  
Martin Sauerhoff ◽  
Georg Schnitger
Keyword(s):  
Communication Complexity

scholarly journals Small PCPs with Low Query Complexity

2001 ◽  
pp. 327-338
Author(s):  
Prahladh Harsha ◽  
Madhu Sudan
Keyword(s):  
Query Complexity
Load More ...
Sign in / Sign up

Export Citation Format

Share Document