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
[1]
Hilfe
Suche: Author="Guibas, L.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lines in space: Combinatorics and algorithms
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
J. Stolfi
Algorithmica
15
, 1996, pp. 428-447
The number of edges of many faces in a line segment arrangement
B. Aronov
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
Combinatorica
12
, 1992, pp. 261-274
Counting and cutting cycles of lines and rods in space
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
R. Pollack
,
R. Seidel
,
M. Sharir
,
J. Snoeyink
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 242-251
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
Lecture Notes in Computer Science
372
, 1989, pp. 179-193
Combinatorial complexity bounds for arrangements of curves and surfaces
K.L. Clarkson
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
E. Welzl
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 568-579
An
O(n^2)
shortest path algorithm for a non-rotating convex body
J. Hershberger
,
L.J. Guibas
Journal of Algorithms
9
(1), 1988, March, pp. 18-46
Optimal point location in a monotone subdivision
H. Edelsbrunner
,
L.J. Guibas
,
J. Stolfi
SIAM Journal on Computing
15
(2), 1986, May, pp. 317-340
Topologically sweeping an arrangement
H. Edelsbrunner
,
L.J. Guibas
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 389-403
Probabilistic analysis of a network resource allocation algorithm
N.A. Lynch
,
N.D. Griffeth
,
M.J. Fischer
,
L.J. Guibas
Information and Control
68
(1-3), 1986, pp. 47-85
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. Drysdale III
,
L.J. Guibas
SIAM Journal on Computing
14
(1), 1985, February, pp. 134-147
Fractional cascading: A data structuring technique with geometric applications
B. Chazelle
,
L.J. Guibas
Lecture Notes in Computer Science
194
, 1985, pp. 90-100
Optimal point location in a monotone subdivision
H. Edelsbrunner
,
L.J. Guibas
,
J. Stolfi
Technical Report, 1984, October
The power ofgeometric duality
B. Chazelle
,
L.J. Guibas
,
D.T. Lee
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 217-225
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
L.J. Guibas
,
J. Stolfi
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 221-234
On computing all northeast nearest neighbors in the
L_1
metric
L.J. Guibas
,
J. Stolfi
Information Processing Letters
17
(4), 1983, November, pp. 219-223
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. (Scot) Drysdale III
,
L.J. Guibas
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 282-289
Efficient searching using partial ordering
A. Borodin
,
L.J. Guibas
,
N.A. Lynch
,
A.C. Yao
Information Processing Letters
12
(2), 1981, April, pp. 71-75
String overlaps, pattern matching, and nontransitive games
L.J. Guibas
,
A.M. Odlyzko
Journal of Combinatorial Theory Series A
30
, 1981, pp. 183-208
A new proof of the linearity of the Boyer-Moore string searching algorithm
L.J. Guibas
,
A.M. Odlyzko
SIAM Journal on Computing
9
(4), 1980, November, pp. 672-682
On translating a set of rectangles
L.J. Guibas
,
F.F. Yao
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 154-160
A dichromatic framework for balanced trees
L.J. Guibas
,
R. Sedgewick
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 8-21
The analysis of double hashing
L.J. Guibas
,
E. Szemeredi
Journal of Computer and System Sciences
16
(2), 1978, April, pp. 226-274
The analysis of hashing techniques that exhibit k-ary clustering
L.J. Guibas
Journal of the ACM
25
, 1978, pp. 544-555
A new representation for linear lists
L.J. Guibas
,
E.M. McCreight
,
M.F. Plass
,
J.R. Roberts
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 49-60
A new proof of the linearity of the Boyer-Moore string searching algorithm
L.J. Guibas
,
A.M. Odlyzko
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 189-195
Seiten 1
2
>