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=J. Algorithms AND Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient pattern matching with scaling
Amihood Amir
,
Gad M. Landau
,
Uzi Vishkin
Journal of Algorithms
13
, 1992, pp. 2-32
Maintenance of a minimum spanning forest in a dynamic plane graph
David Eppstein
,
Giuseppe F. Italiano
,
Roberto Tamassia
,
Robert E. Tarjan
,
Jeffery Westbrook
,
Moti Yung
Journal of Algorithms
13
, 1992, pp. 33-54
Superlinear bounds for matrix searching problems
Maria M. Klawe
Journal of Algorithms
13
, 1992, pp. 55-78
Using separation algorithms in fixed dimension
Carolyn Haibt Norton
,
Serge A. Plotkin
,
éva Tardos
Journal of Algorithms
13
, 1992, pp. 79-98
Optimal binary space partitions for orthogonal objects
Michael S. Paterson
,
F. Frances Yao
Journal of Algorithms
13
, 1992, pp. 99-113
A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs
Jrgen Bang-Jensen
,
Yannis Manoussakis
,
Carsten Thomassen
Journal of Algorithms
13
, 1992, pp. 114-127
Efficient algorithms for listing unlabeled graphs
Leslie Ann Goldberg
Journal of Algorithms
13
, 1992, pp. 128-143
An algorithmic proof that semiorders are representable
Peter Avery
Journal of Algorithms
13
, 1992, pp. 144-147
The traveler's problem
D.S. Hirschberg
,
L.L. Larmore
Journal of Algorithms
13
, 1992, pp. 148-160
Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
Toshinobu Kashiwabara
,
Sumio Masuda
,
Kazuo Nakajima
,
Toshio Fujisawa
Journal of Algorithms
13
, 1992, pp. 161-174
A general best first search algorithm in AND/OR graphs
P.P. Chakrabarti
,
S. Ghose
Journal of Algorithms
13
, 1992, pp. 177-187
Single round simulation on radio networks
Noga Alon
,
Amotz Bar-Noy
,
Nathan Linial
,
David Peleg
Journal of Algorithms
13
, 1992, pp. 188-210
Cubesort: A parallel algorithm for sorting
N
data items with
S
-sorters
Robert Cypher
,
Jorge L.C. Sanz
Journal of Algorithms
13
, 1992, pp. 211-234
On finding and updating shortest paths distributively
K.V.S. Ramarao
,
S. Venkatesan
Journal of Algorithms
13
, 1992, pp. 235-257
Random pseudo-polynomial algorithms for exact matroid problems
P.M. Camerini
,
G. Galbiati
,
F. Maffioli
Journal of Algorithms
13
, 1992, pp. 258-273
A general approach to dominance in the plane
Mark T. de Berg
,
Svante Carlsson
,
Mark H. Overmars
Journal of Algorithms
13
, 1992, pp. 274-296
Minimum bases for permutation groups: The greedy approximation
Kenneth D. Blaha
Journal of Algorithms
13
, 1992, pp. 297-306
Good splitters for counting points in triangles
Jiȓí Matous̑ek
,
Emo Welzl
Journal of Algorithms
13
, 1992, pp. 307-319
Parallel strategies for geometric probing
Michael Lindenbaum
,
Alfred Bruckstein
Journal of Algorithms
13
, 1992, pp. 320-349
Representing sets with constant time equality testing
Daniel M. Yellin
Journal of Algorithms
13
, 1992, pp. 353-373
Sorting with minimum data movement
J. Ian Munro
,
Venkatesh Raman
Journal of Algorithms
13
, 1992, pp. 374-393
An efficient parallel algorithm for the row minima of a totally monotone matrix
Mikhail J. Atallah
,
S. Rao Kosaraju
Journal of Algorithms
13
, 1992, pp. 394-413
Generating necklaces
Frank Ruskey
,
Carla Savage
,
Terry Min Yih Wang
Journal of Algorithms
13
, 1992, pp. 414-430
Faster computation of Bernoulli numbers
Sandra Fillebrown
Journal of Algorithms
13
, 1992, pp. 431-445
Self-alignments in words and their applications
Alberto Apostolico
,
Wojciech Szpankowski
Journal of Algorithms
13
, 1992, pp. 446-467
Seiten 1
2
>