Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 34
Volume 34, Number 1, 2001
- Alan L. Selman:
Editorial Statement. 1 - Evangelos Kranakis
, Danny Krizanc, Flaminia L. Luccio:
On Recognizing a String on an Anonymous Ring. 3-12 - Valmir Carneiro Barbosa, Mario R. F. Benevides, Felipe M. G. França:
Sharing Resources at Nonuniform Access Rates. 13-26 - Pierre B. A. Lecomte, Michel Rigo:
Numeration Systems on a Regular Language. 27-44 - Thomas Noll, Heiko Vogler:
The Universality of Higher-Order Attributed Tree Transducers. 45-75 - Michael Mitzenmacher:
Analyses of Load Stealing Models Based on Families of Differential Equations. 77-98
Volume 34, Number 2, 2001
- Sanguthevar Rajasekaran:
A Framework for Simple Sorting Algorithms on Parallel Disk Systems. 101-114 - Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton:
Thread Scheduling for Multiprogrammed Multiprocessors. 115-144 - Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems. 145-189
Volume 34, Number 3, 2001
- Daniel Kirsten, Gwénaël Richomme:
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. 193-227 - Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
An Improved Stability Bound for Binary Exponential Backoff. 229-244 - Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally Hard Languages. 245-261 - Juha Honkala:
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. 263-272
Volume 34, Number 4, 2001
- Pilar de la Torre, Clyde P. Kruskal:
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. 275-298 - Didier Caucal, Teodor Knapik:
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. 299-336 - Sung Kwon Kim, Chan-Su Shin:
Computing the Optimal Bridge between Two Polygons. 337-352 - Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders. 353-374 - Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special Factors and Uniqueness Conditions in Rational Trees. 375-395
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
