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
[2]
Hilfe
Suche: Author="Chrobak, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
LRU is better than FIFO
M. Chrobak
,
J. Noga
Algorithmica
23
(2), 1999, pp. 180-185
A linear-time algorithm for drawing a planar graph on a grid
M. Chrobak
,
T.H. Payne
Information Processing Letters
54
, 1995, pp. 241-246
New results on server problems
M. Chrobak
,
H. Karloff
,
T. Payne
,
S. Vishwanathan
SIAM Journal on Discrete Mathematics
4
(2), 1991, May, pp. 172-181
Connectivity vs.~reachability
M. Chrobak
,
H. Karloff
,
T. Radzik
Information and Computation
91
(2), 1991, April, pp. 177-188
New results on server problems
M. Chrobak
,
H. Karloff
,
T. Payne
,
S. Vishwanathan
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 291-300
On fast algorithms for two servers
M. Chrobak
,
L.L. Larmore
Lecture Notes in Computer Science
452
, 1990, pp. 202-208
A data structure useful for finding Hamiltonian cycles
M. Chrobak
,
T. Szymacha
,
A. Krawczyk
Theoretical Computer Science
71
, 1990, pp. 419-424
An efficient parallel algorithm for computing a large independent set in a planar graph
M. Chrobak
,
J. Naor
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 379-387
On common edges in optimal solutions to traveling salesman and other optimization problems
M. Chrobak
,
S. Poljak
Discrete Applied Mathematics
20
, 1988, pp. 101-111
Fast parallel and sequential algorithms for edge-coloring planar graphs (extended abstract)
M. Chrobak
,
M. Yung
Lecture Notes in Computer Science
319
, 1988, pp. 11-23
Saturating flows in networks
B.S. Chlebus
,
M. Chrobak
,
K. Diks
Lecture Notes in Computer Science
278
, 1987, pp. 82-91
Remarks on string-matching and one-way multihead automata
M. Chrobak
,
W. Rytter
Information Processing Letters
24
(5), 1987, March, pp. 325-329
Parallel 5-colouring of planar graphs
T. Hagerup
,
M. Chrobak
,
K. Diks
Lecture Notes in Computer Science
267
, 1987, pp. 304-313
k+1
heads are better than
k
for PDA's
M. Chrobak
,
M. Li
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 361-367
Hierarchies of one-way multihead automata languages
M. Chrobak
Theoretical Computer Science
48
(2-3), 1986, pp. 153-181
Finite automata and unary languages
M. Chrobak
Theoretical Computer Science
47
(2), 1986, pp. 149-158
Variations on the technique of Duris and Galil (automata theory)
M. Chrobak
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 77-85
Hierarchies of one-way multihead automata languages
M. Chrobak
Lecture Notes in Computer Science
194
, 1985, pp. 101-110
A characterization of reversal-bounded multipushdown machine languages
W. Rytter
,
M. Chrobak
Theoretical Computer Science
36
(2,3), 1985, pp. 341-344
Probabilistic Turing machines and recursively enumerable Dedekind cuts
M. Chrobak
,
B.S. Chlebus
Information Processing Letters
19
(4), 1984, November, pp. 167-171
A note on bounded-reversal multipushdown machines
M. Chrobak
Information Processing Letters
19
(4), 1984, November, pp. 179-180