Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theory of Computing Systems AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial time introreducibility
Patrizio Cintioli
,
Riccardo Silvestri
Theory of Computing Systems
36
(1), 2003, pp. 1-15
An efficient algorithm for finding all hinge vertices on trapezoid graphs
Debashis Bera
,
Madhumangal Pal
,
Tapan K. Pal
Theory of Computing Systems
36
(1), 2003, pp. 17-27
Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
36
(1), 2003, pp. 29-69
Graph complexity and slice functions
Satyanarayana V. Lokam
Theory of Computing Systems
36
(1), 2003, pp. 71-88
The equivalence problem of polynomially bounded D0L systems - A bound depending only on the size of the alphabet
Juha Honkala
Theory of Computing Systems
36
(1), 2003, pp. 89-103
Essentially every unimodular matrix defines an expander
Jin-Yi Cai
Theory of Computing Systems
36
(2), 2003, pp. 105-135
Routing in series parallel networks
Paola Flocchini
,
Flaminia L. Luccio
Theory of Computing Systems
36
(2), 2003, pp. 137-157
The power of nondeterminism and randomness for oblivious branching programs
Juraj Hromkovic̑
,
Martin Sauerhoff
Theory of Computing Systems
36
(2), 2003, pp. 159-182
Extending stochastic and quantum functions
Simeon Bozapalidis
Theory of Computing Systems
36
(2), 2003, pp. 183-197
PP
-lowness and a simple definition of
AWPP
Stephen A. Fenner
Theory of Computing Systems
36
(2), 2003, pp. 199-212
Semantical counting circuits
Fabrice Noilhan
,
Miklos Santha
Theory of Computing Systems
36
(3), 2003, pp. 217-229
Undecidable problems for probabilistic automata of fixed dimension
Vincent D. Blondel
,
Vincent Canterini
Theory of Computing Systems
36
(3), 2003, pp. 231-245
Tree series transformations that respect copying
Zoltán Fülöp
,
Heiko Vogler
Theory of Computing Systems
36
(3), 2003, pp. 247-293
A note on square rooting of time functions of Turing machines
Richard J. Lipton
,
Mitsunori Ogihara
,
Yechezkel Zalcstein
Theory of Computing Systems
36
(3), 2003, pp. 295-299
Arithmetic complexity, Kleene closure, and formal power series
Eric Allender
,
V. Arvind
,
Meena Mahajan
Theory of Computing Systems
36
(4), 2003, pp. 303-328
Dynamic generation of discrete random variates
Yossi Matias
,
Jeffrey Scott Vitter
,
Wen-Chun Ni
Theory of Computing Systems
36
(4), 2003, pp. 329-357
The (non)enumerability of the determinant and the rank
Alina Beygelzimer
,
Mitsunori Ogihara
Theory of Computing Systems
36
(4), 2003, pp. 359-374
Exact complexity of the winner problem for young elections
Jörg Rothe
,
Holger Spakowski
,
Jörg Vogel
Theory of Computing Systems
36
(4), 2003, pp. 375-386
A note on non-deterministic communication complexity with few witnesses
Vince Grolmusz
,
Gábor Tardos
Theory of Computing Systems
36
(4), 2003, pp. 387-391
Scalable room synchronizations
Guy E. Blelloch
,
Perry Cheng
,
Phillip B. Gibbons
Theory of Computing Systems
36
(5), 2003, pp. 397-430
Automatable verification of sequential consistency
Anne E. Condon
,
Alan J. Hu
Theory of Computing Systems
36
(5), 2003, pp. 431-460
On spectral bounds for the
k
-partitioning of graphs
Robert Elsässer
,
Thomas Lücking
,
Burkhard Monien
Theory of Computing Systems
36
(5), 2003, pp. 461-478
Deterministic resource discovery in distributed networks
Shay Kutten
,
David Peleg
,
Uzi Vishkin
Theory of Computing Systems
36
(5), 2003, pp. 479-495
Approximation algorithms for data management in networks
Christof Krick
,
Harald Räcke
,
Matthias Westermann
Theory of Computing Systems
36
(5), 2003, pp. 497-519
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach
Dorit Naishlos
,
Joseph Nuzman
,
Chau-Wen Tseng
,
Uzi Vishkin
Theory of Computing Systems
36
(5), 2003, pp. 521-552
Seiten 1
2
>