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: Author="Berry, Jonathan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Skip-splay: Toward achieving the unified bound in the BST model
Jonathan C. Derryberry
,
Daniel D. Sleator
Lecture Notes in Computer Science
5664
, 2009, pp. 194-205
Challenges in parallel graph processing
Andrew Lumsdaine
,
Douglas Gregor
,
Bruce Hendrickson
,
Jonathan Berry
Parallel Processing Letters
17
(1), 2007, pp. 5-20
Scheduling an industrial production facility
Eyjolfur Asgeirsson
,
Jonathan Berry
,
Cynthia A. Phillips
,
David J. Phillips
,
Cliff Stein
,
Joel Wein
Lecture Notes in Computer Science
3064
, 2004, pp. 116-131
Path optimization for graph partitioning problems
Jonathan W. Berry
,
Mark K. Goldberg
Discrete Applied Mathematics
90
(1-3), 1999, pp. 27-50
Graph drawing and manipulation with LINK
Jonathan Berry
,
Nathaniel Dean
,
Mark Goldberg
,
Gregory Shannon
,
Steven Skiena
Lecture Notes in Computer Science
1353
, 1998, pp. 425-437
Path optimization and near-greedy analysis for graph partitioning: An empirical study
Jonathan Berry
,
Mark Goldberg
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 223-232