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=Theor.~Comput.~Sci. AND Volume=321
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The level ancestor problem simplified
Michael A. Bender
,
M. Martín Farach-Colton
Theoretical Computer Science
321
(1), 2004, pp. 5-12
Flow metrics
Claudson F. Bornstein
,
Santosh Vempala
Theoretical Computer Science
321
(1), 2004, pp. 13-24
Space-efficient planar convex hull algorithm
Hervé Brönnimann
,
John Iacono
,
Jyrki Katajainen
,
Pat Morin
,
Jason Morrison
,
Godfried Toussaint
Theoretical Computer Science
321
(1), 2004, pp. 25-40
Searching in random partially ordered sets
R. Carmo
,
J. Donadelli
,
Y. Kohayakawa
,
E. Laber
Theoretical Computer Science
321
(1), 2004, pp. 41-57
The generalized Weil pairing and the discrete logarithm problem on elliptic curves
Theodoulos Garefalakis
Theoretical Computer Science
321
(1), 2004, pp. 59-72
Electronic jury voting protocols
Alejandro Hevia
,
Marcos Kiwi
Theoretical Computer Science
321
(1), 2004, pp. 73-94
An efficient algorithm for sequence comparison with block reversals
S. Muthukrishnan
,
S. Cenk Sahinalp
Theoretical Computer Science
321
(1), 2004, pp. 95-101
Tight bounds for online class-constrained packing
Hadas Shachnai
,
Tami Tamir
Theoretical Computer Science
321
(1), 2004, pp. 103-123
Packing arrays
Brett Stevens
,
Eric Mendelsohn
Theoretical Computer Science
321
(1), 2004, pp. 125-148
Computing Boolean functions from multiple faulty copies of input bits
Mario Szegedy
,
Xiaomin Chen
Theoretical Computer Science
321
(1), 2004, pp. 149-170
On dart-free perfectly contractile graphs
Cláudia Linhares Sales
,
Frédéric Maffray
Theoretical Computer Science
321
(2-3), 2004, pp. 171-194
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Keqin Li
Theoretical Computer Science
321
(2-3), 2004, pp. 195-214
Graph traversal and graph transformation
Jason J. Holdsworth
Theoretical Computer Science
321
(2-3), 2004, pp. 215-231
Evolution and observation - A non-standard way to generate formal languages
Matteo Cavaliere
,
Peter Leupold
Theoretical Computer Science
321
(2-3), 2004, pp. 233-248
On Kurtz randomness
Rodney G. Downey
,
Evan J. Griffiths
,
Stephanie Reid
Theoretical Computer Science
321
(2-3), 2004, pp. 249-270
On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
Theoretical Computer Science
321
(2-3), 2004, pp. 271-281
Average complexity of exact and approximate multiple string matching
Gonzalo Navarro
,
Kimmo Fredriksson
Theoretical Computer Science
321
(2-3), 2004, pp. 283-290
Updatable timed automata
Patricia Bouyer
,
Catherine Dufourd
,
Emmanuel Fleury
,
Antoine Petit
Theoretical Computer Science
321
(2-3), 2004, pp. 291-345
On the complexity of resolution with bounded conjunctions
Juan Luis Esteban
,
Nicola Galesi
,
Jochen Messner
Theoretical Computer Science
321
(2-3), 2004, pp. 347-370
On domain-partitioning induction criteria: Worst-case bounds for the worst-case based
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
321
(2-3), 2004, pp. 371-382
Peg-solitaire, string rewriting systems and finite automata
B. Ravikumar
Theoretical Computer Science
321
(2-3), 2004, pp. 383-394
Sturmian words,
\beta
-shifts, and transcendence
Dong Pyo Chi
,
DoYong Kwon
Theoretical Computer Science
321
(2-3), 2004, pp. 395-404
Longest increasing subsequences in sliding windows
Michael H. Albert
,
Alexander Golynski
,
Angèle M. Hamel
,
Alejandro López-Ortiz
,
S. Srinivasa Rao
,
Mohammad Ali Safari
Theoretical Computer Science
321
(2-3), 2004, pp. 405-414
Seventeen lines and one-hundred-and-one points
Gerhard J. Woeginger
Theoretical Computer Science
321
(2-3), 2004, pp. 415-421