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=181
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Space-filling curves and their use in the design of geometric data structures
Tetsuo Asano
,
Desh Ranjan
,
Thomas Roos
,
Emo Welzl
,
Peter Widmayer
Theoretical Computer Science
181
(1), 1997, pp. 3-15
Bertrand numeration systems and recognizability
Véronique Bruyère
,
Georges Hansel
Theoretical Computer Science
181
(1), 1997, pp. 17-43
Probabilistic recurrence relations revisited
Shiva Chaudhuri
,
Devdatt Dubhashi
Theoretical Computer Science
181
(1), 1997, pp. 45-56
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
David Fernández-Baca
,
Giora Slutzki
Theoretical Computer Science
181
(1), 1997, pp. 57-74
Paging more than one page
Esteban Feuerstein
Theoretical Computer Science
181
(1), 1997, pp. 75-90
On edge-colouring indifference graphs
Celina M.H. de Figueiredo
,
João Meidanis
,
Célia Picinin de Mello
Theoretical Computer Science
181
(1), 1997, pp. 91-106
On the approximability of some maximum spanning tree problems
Giulia Galbiati
,
Angelo Morzenti
,
Francesco Maffioli
Theoretical Computer Science
181
(1), 1997, pp. 107-118
Binary search and recursive graph problems
William I. Gasarch
,
Katia S. Guimarães
Theoretical Computer Science
181
(1), 1997, pp. 119-139
Pushdown automata with bounded nondeterminism and bounded ambiguity
Christian Herzog
Theoretical Computer Science
181
(1), 1997, pp. 141-157
Block edit models for approximate string matching
Daniel Lopresti
,
Andrew Tomkins
Theoretical Computer Science
181
(1), 1997, pp. 159-179
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
Helmut Prodinger
Theoretical Computer Science
181
(1), 1997, pp. 181-194
A temporal logic for real-time partial ordering with named transactions
Farn Wang
Theoretical Computer Science
181
(1), 1997, pp. 195-225
No
NP
problems averaging over ranking of distributions are harder
Jay Belanger
,
Jie Wang
Theoretical Computer Science
181
(2), 1997, pp. 229-245
Algorithmic graph embeddings
Jianer Chen
Theoretical Computer Science
181
(2), 1997, pp. 247-266
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Josep Díaz
,
Alan Gibbons
,
Grammati E. Pantziou
,
Maria J. Serna
,
Paul G. Spirakis
,
Jacobo Toran
Theoretical Computer Science
181
(2), 1997, pp. 267-287
Transformations that preserve malignness of universal distributions
Kojiro Kobayashi
Theoretical Computer Science
181
(2), 1997, pp. 289-306
Maximum tree-packing in time
O(n^{5/2})
Andrzej Lingas
Theoretical Computer Science
181
(2), 1997, pp. 307-316
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
Kouichi Sakurai
Theoretical Computer Science
181
(2), 1997, pp. 317-335
Small weight bases for Hamming codes
John Tromp
,
Louxin Zhang
,
Ying Zhao
Theoretical Computer Science
181
(2), 1997, pp. 337-345
A
\frac{3}{2}\log3
-competitive algorithm for the counterfeit coin problem
Peng-Jun Wan
,
Qifan Yang
,
Dean Kelley
Theoretical Computer Science
181
(2), 1997, pp. 347-356
Scheduling task-trees with additive scales on parallel-distributed machines
Xiangdong Yu
,
Moti Yung
Theoretical Computer Science
181
(2), 1997, pp. 357-378
Compact location problems
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
Theoretical Computer Science
181
(2), 1997, pp. 379-404