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. ACM AND Volume=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals
Sridhar Hannenhalli
,
Pavel A. Pevzner
Journal of the ACM
46
(1), 1999, pp. 1-27
Fully dynamic planarity testing with applications
Zvi Galil
,
Giuseppe F. Italiano
,
Neil Sarnak
Journal of the ACM
46
(1), 1999, pp. 28-91
An optimality proof of the LRU-
K
page replacement algorithm
Elizabeth J. O'Neil
,
Patrick E. O'Neil
,
Gerhard Weikum
Journal of the ACM
46
(1), 1999, pp. 92-112
Complexity estimates depending on condition and round-off error
Felipe Cucker
,
Steve Smale
Journal of the ACM
46
(1), 1999, pp. 113-184
The computational complexity of knot and link problems
Joel Hass
,
Jeffrey C. Lagarias
,
Nicholas Pippenger
Journal of the ACM
46
(2), 1999, pp. 185-211
Reconstructing a three-dimensional model with arbitrary errors
Bonnie Berger
,
Jon Kleinberg
,
Tom Leighton
Journal of the ACM
46
(2), 1999, pp. 212-235
The string B-Tree: A new data structure for string search in external memory and its applications
Paolo Ferragina
,
Roberto Grossi
Journal of the ACM
46
(2), 1999, pp. 236-280
Provably efficient scheduling for languages with fine-grained parallelism
Guy E. Blelloch
,
Phillip B. Gibbons
,
Yossi Matias
Journal of the ACM
46
(2), 1999, pp. 281-321
Some contributions to the metatheory of the situation calculus
Fiora Pirri
,
Ray Reiter
Journal of the ACM
46
(3), 1999, pp. 325-361
Undirected single-source shortest paths with positive integer weights in linear time
Mikkel Thorup
Journal of the ACM
46
(3), 1999, pp. 362-394
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Gene Myers
Journal of the ACM
46
(3), 1999, pp. 395-415
Generation of universal series-parallel Boolean functions
F.Y. Young
,
Chris C.N. Chu
,
D.F. Wong
Journal of the ACM
46
(3), 1999, pp. 416-435
Efficient algorithms for inverting evolution
Martin Farach
,
Sampath Kannan
Journal of the ACM
46
(4), 1999, pp. 437-449
Primality testing using elliptic curves
Shafi Goldwasser
,
Joe Kilian
Journal of the ACM
46
(4), 1999, pp. 450-472
On the efficiency of pairing heaps and related data structures
Michael L. Fredman
Journal of the ACM
46
(4), 1999, pp. 473-501
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika R. Henzinger
,
Valerie King
Journal of the ACM
46
(4), 1999, pp. 502-516
Mutual search
Harry Buhrman
,
Matthew Franklin
,
Juan A. Garay
,
Jaap-Henk Hoepman
,
John Tromp
,
Paul Vitányi
Journal of the ACM
46
(4), 1999, pp. 517-536
New results on quantifier elimination over real closed fields and applications to constraint databases
Saugata Basu
Journal of the ACM
46
(4), 1999, pp. 537-555
Finding circular attributes in attribute grammars
Michael Rodeh
,
Mooly Sagiv
Journal of the ACM
46
(4), 1999, pp. 556-575
Purely functional, real-time deques with catenation
Haim Kaplan
,
Robert E. Tarjan
Journal of the ACM
46
(5), 1999, pp. 577-603
Authoritative sources in a hyperlinked environment
Jon M. Kleinberg
Journal of the ACM
46
(5), 1999, pp. 604-632
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Cynthia Dwork
,
Orli Waarts
Journal of the ACM
46
(5), 1999, pp. 633-666
Linear hash functions
Noga Alon
,
Martin Dietzfelbinger
,
Peter Bro Miltersen
,
Erez Petrank
,
Gábor Tardos
Journal of the ACM
46
(5), 1999, pp. 667-683
Sample-efficient strategies for learning in the presence of noise
Nicolò Cesa-Bianchi
,
Eli Dichterman
,
Paul Fischer
,
Eli Shamir
,
Hans Ulrich Simon
Journal of the ACM
46
(5), 1999, pp. 684-719
Scheduling multithreaded computations by work stealing
Robert D. Blumofe
,
Charles E. Leiserson
Journal of the ACM
46
(5), 1999, pp. 720-748
Seiten 1
2
>