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="Rosenkrantz, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for degree-constrained minimum-cost network-design problems
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Algorithmica
31
(1), 2001, pp. 58-78
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
D.J. Rosenkrantz
,
L. Yu
,
S.S. Ravi
Algorithmica
30
(1), 2001, pp. 83-100
Compact location problems
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
Theoretical Computer Science
181
(2), 1997, pp. 379-404
Spanning trees-Short or small
R. Ravi
,
R. Sundaram
,
M.V. Marathe
,
D.J. Rosenkrantz
,
S.S. Ravi
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 178-200
On the size of binary decision diagrams representing Boolean functions
Y. Breitbart
,
H. Hunt III
,
D. Rosenkrantz
Theoretical Computer Science
145
(1-2), 1995, pp. 45-69
Simple heuristics for unit disk graphs
M.V. Marathe
,
H. Breu
,
H.B. Hunt III
,
S.S. Ravi
,
D.J. Rosenkrantz
Networks
25
(1), 1995, pp. 59-68
Bicriteria network design problems
M.V. Marathe
,
R. Ravi
,
R. Sundaram
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Lecture Notes in Computer Science
944
, 1995, pp. 487-498
Partitioning message patterns for bundled Omega networks
P.J. Bernhard
,
D.J. Rosenkrantz
IEEE Transactions on Parallel and Distributed Systems
5
(4), 1994, pp. 353-363
A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 424-435
Approximation schemes using
L
-reductions
^{1,2,3}
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Lecture Notes in Computer Science
880
, 1994, pp. 342-353
Spanning trees short or small
R. Ravi
,
R. Sundaram
,
M.V. Marathe
,
D.J. Rosenkrantz
,
S.S. Ravi
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 546-555
Determining performance measures of algorithm-based fault tolerant systems
Dechang Gu
,
D.J. Rosenkrantz
,
S.S. Ravi
Journal Parallel Distributed Computing
18
(1), 1993, pp. 56-70
Many birds with one stone: Multi-objective approximation algorithms (extended abstract)
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 438-447
Compaction of message patterns into succinct representations for multiprocessor interconnection networks
P.J. Bernhard
,
H.B. Hunt III
,
D.J. Rosenkrantz
Journal Parallel Distributed Computing
12
(1), 1991, May, pp. 39-49
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks
P.J. Bernhard
,
D.J. Rosenkrantz
Journal Parallel Distributed Computing
11
(1), 1991, January, pp. 72-85
Using the dual path property of Omega networks to obtain conflict-free message routing
P.J. Bernhard
,
D.J. Rosenkrantz
IEEE Transactions on Parallel and Distributed Systems
2
(4), 1991, pp. 503-507
Facility dispersion problems: Heuristics and special cases
S.S. Ravi
,
D.J. Rosenkrantz
,
G.K. Tayi
Lecture Notes in Computer Science
519
, 1991, pp. 355-366
Compaction of message patterns into space-efficient representations for multiprocessor interconnection networks
P.J. Bernhard
,
H.B. Hunt III
,
D.J. Rosenkrantz
Proceedings of the 1989 International Conference on Parallel Processing. Vol.~1 Architecture, ICPP'89 (Penn State University, August 8-12, 1989)
, 1989, pp. 111-115
The complexity of routing through an Omega network
P.J. Bernhard
,
D.J. Rosenkrantz
Technical Report (87-12), 1987
On the computational complexity of algebra on lattices
H.B. Hunt III
,
D.J. Rosenkrantz
,
P.A. Bloniarz
SIAM Journal on Computing
16
(1), 1987, February, pp. 129-148
Recursion schemes and recursive programs are exponentially hard to analyze
H.B. Hunt III
,
D.J. Rosenkrantz
SIAM Journal on Computing
15
(3), 1986, August, pp. 831-850
Testing for grammatical coverings
D.J. Rosenkrantz
,
H.B. Hunt III
Theoretical Computer Science
38
(2,3), 1985, pp. 323-341
Algebraic structures with hard equivalence and minimization problems
P.A. Bloniarz
,
H.B. Hunt III
,
D.J. Rosenkrantz
Journal of the ACM
31
(4), 1984, pp. 879-904
The complexity of monadic recursion schemes: exponential time bounds
H.B. Hunt III
,
D.J. Rosenkrantz
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 395-419
Consistency and serializability in concurrent database systems
D.J. Rosenkrantz
,
R.E. Stearns
,
P.M. Lewis II
SIAM Journal on Computing
13
(3), 1984, August, pp. 508-530
Seiten 1
2
>