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="Frederickson, G.N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maintaining regular properties dynamically in
k
-terminal graphs
G.N. Frederickson
Algorithmica
22
(3), 1998, pp. 330-350
Searching among intervals and compact routing tables
G.N. Frederickson
Algorithmica
15
, 1996, pp. 448-466
Planar graph decomposition and all pairs shortest paths
G.N. Frederickson
Journal of the ACM
38
(1), 1991, January, pp. 162-204
The information theory bound is tight for selection in a heap
G.N. Frederickson
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 26-33
Ensemble motion planning on trees
G.N. Frederickson
,
D.J. Guan
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 66-71
Sorting with efficient use of special-purpose sorters
M.J. Atallah
,
G.N. Frederickson
,
S. Rao Kosaraju
Information Processing Letters
27
(1), 1988, February, pp. 13-15
Electing a leader in a synchronous ring
G.N. Frederickson
,
N.A. Lynch
Journal of the ACM
34
(1), 1987, pp. 98-115
A new approach to all pairs shortest paths in planar graphs
G.N. Frederickson
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 19-28
Upper bounds for time-space trade-offs in sorting and selection
G.N. Frederickson
Journal of Computer and System Sciences
34
(1), 1987, February, pp. 19-26
Fast algorithms for shortest paths in planar graphs, with applications
G.N. Frederickson
SIAM Journal on Computing
16
(6), 1987, December, pp. 1004-1022
Separator-based strategies for efficient message routing
G.N. Frederickson
,
R. Janardan
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 428-437
Breaking symmetry in synchronous networks
G.N. Frederickson
,
N. Santoro
Lecture Notes in Computer Science
227
, 1986, pp. 26-33
Implicit data structures for weighted elements
G.N. Frederickson
Information and Control
66
(1-2), 1985, pp. 61-82
Data structures for on-line updating of minimum spanning trees with applications
G.N. Frederickson
SIAM Journal on Computing
14
(4), 1985, November, pp. 781-798
Generalized selection and ranking: sorted matrices
G.N. Frederickson
,
D.B. Johnson
SIAM Journal on Computing
13
(1), 1984, February, pp. 14-30
Self-organizing heuristics for implicit data structures
G.N. Frederickson
SIAM Journal on Computing
13
(2), 1984, May, pp. 277-291
On linear-time algorithms for five-coloring planar graphs
G.N. Frederickson
Information Processing Letters
19
(5), 1984, November, pp. 219-224
Recursively rotated orders and implicit data structures: A lower bound
G.N. Frederickson
Theoretical Computer Science
29
(1,2), 1984, pp. 75-85
Finding KTH paths and p-centers by generating and searching good data structures
G.N. Frederickson
,
D.B. Johnson
Journal of Algorithms
4
(1), 1983, March, pp. 61-80
Data structures for on-line updating of minimum spanning trees
G.N. Frederickson
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 252-257
Implicit data structures for the dictionary problem
G.N. Frederickson
Journal of the ACM
30
(1), 1983, pp. 80-94
Shortest path problems in planar graphs
G.N. Frederickson
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 242-247
Scheduling unit-time tasks with integer release times and deadlines
G.N. Frederickson
Information Processing Letters
16
(4), 1983, May, pp. 171-173
On the relationship between the biconnectivity augmentation and travelling salesman problems
G.N. Frederickson
,
J. Ja'Ja
Theoretical Computer Science
19
, 1982, pp. 189-201
The complexity of selection and ranking in x+y and matrices with sorted columns
G.N. Frederickson
,
D.B. Johnson
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 197-208
Seiten 1
2
>