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 Volume=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Odometers on regular languages
Valérie Berthé
,
Michel Rigo
Theory of Computing Systems
40
(1), 2007, pp. 1-31
Chinese remaindering with multiplicative noise
Igor E. Shparlinski
,
Ron Steinfeld
Theory of Computing Systems
40
(1), 2007, pp. 33-41
The structure of infinite solutions of marked and binary post correspondence problems
Vesa Halava
,
Tero Harju
,
Juhani Karhumäki
Theory of Computing Systems
40
(1), 2007, pp. 43-54
Compact labeling scheme for XML ancestor queries
Haim Kaplan
,
Tova Milo
,
Ronen Shabo
Theory of Computing Systems
40
(1), 2007, pp. 55-99
OBDD-based cryptanalysis of oblivious keystream generators
Matthias Krause
Theory of Computing Systems
40
(1), 2007, pp. 101-121
A simple 3-edge-connected component algorithm
Yung H. Tsin
Theory of Computing Systems
40
(2), 2007, pp. 125-142
Rendezvous and election of mobile agents: Impact of sense of direction
Lali Barrière
,
Paola Flocchini
,
Pierre Fraigniaud
,
Nicola Santoro
Theory of Computing Systems
40
(2), 2007, pp. 143-162
Query learning of regular tree languages: How to avoid dead states
Frank Drewes
,
Johanna Högberg
Theory of Computing Systems
40
(2), 2007, pp. 163-185
Constant approximation algorithms for rectangle stabbing and related problems
Guang Xu
,
Jinhui Xu
Theory of Computing Systems
40
(2), 2007, pp. 187-204
Distribution of additive functions with respect to numeration systems on regular languages
Peter J. Grabner
,
Michel Rigo
Theory of Computing Systems
40
(3), 2007, pp. 205-223
Efficient exploration of faulty trees
Euripides Markou
,
Andrzej Pelc
Theory of Computing Systems
40
(3), 2007, pp. 225-247
Randomized algorithms for 3-SAT
Thomas Hofmeister
,
Uwe Schöning
,
Rainer Schuler
,
Osamu Watanabe
Theory of Computing Systems
40
(3), 2007, pp. 249-262
Dichotomies in the complexity of solving systems of equations over finite semigroups
O. Klíma
,
P. Tesson
,
D. Thérien
Theory of Computing Systems
40
(3), 2007, pp. 263-297
Characterizing TC
^0
in terms of infinite groups
Andreas Krebs
,
Klaus-Jörn Lange
,
Stephanie Reifferscheid
Theory of Computing Systems
40
(4), 2007, pp. 303-325
Sorting stably, in place, with
O(n \log n)
comparisons and
O(n)
moves
Gianni Franceschini
Theory of Computing Systems
40
(4), 2007, pp. 327-353
Dynamic complexity theory revisited
Volker Weber
,
Thomas Schwentick
Theory of Computing Systems
40
(4), 2007, pp. 355-377
Robust polynomials and quantum algorithms
Harry Buhrman
,
Ilan Newman
,
Hein Röhrig
,
Ronald de Wolf
Theory of Computing Systems
40
(4), 2007, pp. 379-395
Topological automata
Emmanuel Jeandel
Theory of Computing Systems
40
(4), 2007, pp. 397-407
Cellular automata: Real-time equivalence between one-dimensional neighborhoods
Victor Poupet
Theory of Computing Systems
40
(4), 2007, pp. 409-421
Truthful approximation mechanisms for scheduling selfish related machines
Nir Andelman
,
Yossi Azar
,
Motti Sorani
Theory of Computing Systems
40
(4), 2007, pp. 423-436
The variable hierarchy of the
\mu
-calculus is strict
Dietmar Berwanger
,
Erich Grädel
,
Giacomo Lenzi
Theory of Computing Systems
40
(4), 2007, pp. 437-466
Roundings respecting hard constraints
Benjamin Doerr
Theory of Computing Systems
40
(4), 2007, pp. 467-483
Algorithms to compute minimum cycle basis in directed graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
Theory of Computing Systems
40
(4), 2007, pp. 485-505
Varieties of codes and Kraft inequality
F. Burderi
,
A. Restivo
Theory of Computing Systems
40
(4), 2007, pp. 507-520
The power of commuting with finite sets of words
Michal Kunc
Theory of Computing Systems
40
(4), 2007, pp. 521-551
Seiten 1
2
>