Theory of Computing Systems
, Volume 33
Volume 33, Number 1, 2000
Pierluigi Crescenzi
,
Luca Trevisan
:
On Approximation Scheme Preserving Reducibility and Its Applications.
1-16
Electronic Edition
(
Springer LINK
)
BibTeX
Yoshifumi Sakai
,
Akira Maruoka
:
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution.
17-33
Electronic Edition
(
Springer LINK
)
BibTeX
Sanjay Jain
,
Arun Sharma
:
Team Learning of Computable Languages.
35-58
Electronic Edition
(
Springer LINK
)
BibTeX
Akio Fujiyoshi
,
Takumi Kasai
:
Spinal-Formed Context-Free Tree Grammars.
59-83
Electronic Edition
(
Springer LINK
)
BibTeX
Stefan D. Bruda
,
Selim G. Akl
:
The Characterization of Data-Accumulating Algorithms.
85-96
Electronic Edition
(
Springer LINK
)
BibTeX
Hong-Chung Chen
,
Yue-Li Wang
:
An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees.
97-105
Electronic Edition
(
Springer LINK
)
BibTeX
Luis B. Morales
,
A. Sánchez-Flores
:
Erratum: Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices.
107
Electronic Edition
(
Springer LINK
)
BibTeX
Volume 33, Number 2, 2000
David W. Juedes
,
Jack H. Lutz
:
Modeling Time-Bounded Prefix Kolmogorov Complexity.
111-123
Electronic Edition
(
Springer LINK
)
BibTeX
Bruno Courcelle
,
Johann A. Makowsky
,
Udi Rotics
:
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
125-150
Electronic Edition
(
Springer LINK
)
BibTeX
Wolfgang Lindner
,
Rainer Schuler
,
Osamu Watanabe
:
Resource-Bounded Measure and Learnability.
151-170
Electronic Edition
(
Springer LINK
)
BibTeX
Volume 33, Number 3, 2000
Panagiota Fatourou
,
Paul G. Spirakis
:
Efficient Scheduling of Strict Multithreaded Computations.
173-232
Electronic Edition
(
Springer LINK
)
BibTeX
C. Greg Plaxton
,
Torsten Suel
:
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
233-254
Electronic Edition
(
Springer LINK
)
BibTeX
Volume 33, Number 4, 2000
Alessandra Cherubini
,
Pierluigi San Pietro
:
Tree Adjoining Languages and Multipushdown Languages.
257-293
Electronic Edition
(
Springer LINK
)
BibTeX
Jochen Alber
,
Rolf Niedermeier
:
On Multidimensional Curves with Hilbert Property.
295-312
Electronic Edition
(
Springer LINK
)
BibTeX
Martin Sauerhoff
:
An Improved Hierarchy Result for Partitioned BDDs.
313-329
Electronic Edition
(
Springer LINK
)
BibTeX
Volume 33, Number 5/6, 2000
Arnold L. Rosenberg
:
Editorial Message.
333
Electronic Edition
(
Springer LINK
)
BibTeX
Thomas H. Cormen
,
Frank K. H. A. Dehne
,
Pierre Fraigniaud
,
Yossi Matias
:
Guest Editors' Foreword.
335-335
Electronic Edition
(
Springer LINK
)
BibTeX
Micah Adler
,
Christian Scheideler
:
Efficient Communication Strategies for Ad Hoc Wireless Networks.
337-391
Electronic Edition
(
Springer LINK
)
BibTeX
Ambrose Kofi Laing
,
Robert Cypher
,
Christian A. Duncan
:
On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks.
393-426
Electronic Edition
(
Springer LINK
)
BibTeX
Spyros C. Kontogiannis
,
Grammati E. Pantziou
,
Paul G. Spirakis
,
Moti Yung
:
Robust Parallel Computations through Randomization.
427-464
Electronic Edition
(
Springer LINK
)
BibTeX
Artur Czumaj
:
Recovery Time of Dynamic Allocation Processes.
465-487
Electronic Edition
(
Springer LINK
)
BibTeX
Hannah Bast
:
On Scheduling Parallel Tasks at Twilight.
489-563
Electronic Edition
(
Springer LINK
)
BibTeX
Copyright ©
Sun May 17 00:14:26 2009 by
Michael Ley
(
ley@uni-trier.de
)