STACS 99 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

54
(FIVE YEARS 0)

H-INDEX

11
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540656913, 9783540491163
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Constructing Light Spanning Trees with Small Routing Cost

1999 ◽  
pp. 334-344 ◽  
Author(s):  
Bang Ye Wu ◽  
Kun-Mao Chao ◽  
Chuan Yi Tang
Keyword(s):  
Spanning Trees

The Descriptive Complexity Approach to LOGCFL

1999 ◽  
pp. 444-454 ◽  
Author(s):  
Clemens Lautemann ◽  
Pierre McKenzie ◽  
Thomas Schwentick ◽  
Heribert Vollmer
Keyword(s):  
Descriptive Complexity

Supporting Increment and Decrement Operations in Balancing Networks

1999 ◽  
pp. 393-403 ◽  
Author(s):  
William Aiello ◽  
Costas Busch ◽  
Maurice Herlihy ◽  
Marios Mavronicolas ◽  
Nir Shavit ◽  
...  

Lower Bounds for Dynamic Algebraic Problems

1999 ◽  
pp. 362-372 ◽  
Author(s):  
Gudmund Skovbjerg Frandsen ◽  
Johan P. Hansen ◽  
Peter Bro Miltersen
Keyword(s):  
Lower Bounds

Finding Paths with the Right Cost

1999 ◽  
pp. 345-355 ◽  
Author(s):  
Matti Nykänen ◽  
Esko Ukkonen
Keyword(s):  
The Right

Descriptive Complexity of Computable Sequences

1999 ◽  
pp. 153-162 ◽  
Author(s):  
Bruno Durand ◽  
Alexander Shen ◽  
Nikolai Vereshagin
Keyword(s):  
Descriptive Complexity

On Quadratic Word Equations

1999 ◽  
pp. 217-226 ◽  
Author(s):  
John Michael Robson ◽  
Volker Diekert
Keyword(s):  
Word Equations
Load More ...
Sign in / Sign up

Export Citation Format

Share Document