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="Ru{\v{z}}i{\v{c}}ka, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
R. Královic̑
,
P. Ruz̑ic̑ka
Theoretical Computer Science
374
(1-3), 2007, pp. 203-213
Black hole search in common interconnection networks
S. Dobrev
,
P. Flocchini
,
R. Královic̑
,
P. Ruz̑ic̑ka
,
G. Prencipe
,
N. Santoro
Networks
47
(2), 2006, pp. 61-71
Interval routing on layered cross product of trees and cycles
R. Král̑ovic̑
,
B. Rovan
,
P. Ruz̑ic̑ka
Lecture Notes in Computer Science
1685
, 1999, pp. 1231-1239
The complexity of shortest path and dilation bounded interval routing
R. Král̑ovic̑
,
P. Ruz̑ic̑ka
,
D. S̑tefankovic̑
Lecture Notes in Computer Science
1300
, 1997, pp. 258-265
On tree pattern unification problems
P. Ruz̑ic̑ka
,
I. Prívara
Proceedings of the 9th International Conference on Fundamentals of Computation Theory. FCT '93 (Szeged, Hungary, August 1993)
LNCS 710
, 1993, pp. 418-429
An almost linear Robinson unification algorithm
P. Ruz̑ic̑ka
,
I. Privara
Acta Informatica
27
, 1989, pp. 61-71
An almost linear Robinson unification algorithm
P. Ruz̑ic̑ka
,
I. Prívara
Lecture Notes in Computer Science
324
, 1988, pp. 501-511
On efficiency of interval routing algorithms
P. Ruz̑ic̑ka
Lecture Notes in Computer Science
324
, 1988, pp. 492-500