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="Bornstein, Claudson"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The pair completion algorithm for the homogeneous set sandwich problem
Claudson Bornstein
,
Celina M.H. de Figueiredo
,
Vinícius G.P. de Sá
Information Processing Letters
98
(3), 2006, pp. 87-91
Flow metrics
Claudson F. Bornstein
,
Santosh Vempala
Theoretical Computer Science
321
(1), 2004, pp. 13-24
Tradeoffs between parallelism and fill in nested dissection
Claudson F. Bornstein
,
Bruce M. Maggs
,
Gary L. Miller
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 (Saint-Malo, France, June 27-30,1999)
, 1999, pp. 191-200
On the bisection width and expansion of butterfly networks
Claudson Bornstein
,
Ami Litman
,
Bruce M. Maggs
,
Ramesh K. Sitaraman
,
Tal Yatzkar
Proceedings of the Merged 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP'98 (Orlando, Florida, March 30 - April 3, 1998)
, 1998, pp. 144-150
Iterated clique graphs with increasing diameters
Claudson F. Bornstein
,
Jayme L. Szwarcfiter
Journal of Graph Theory
28
(3), 1998, pp. 147-154
Parallelizing elimination orders with linear fill
Claudson Bornstein
,
Bruce Maggs
,
Gary Miller
,
R. Ravi
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 274-283
On clique convergent graphs
Claudson F. Bornstein
,
Jayme L. Szwarcfiter
Graphs and Combinatorics
11
, 1995, pp. 213-220
Clique graphs of chordal and path graphs
Jayme L. Szwarcfiter
,
Claudson F. Bornstein
SIAM Journal on Discrete Mathematics
7
(2), 1994, May, pp. 331-336