Peter Ruzicka - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2007

Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routingRastislav Kralovic, Peter Ruzicka. TCS, 374(1-3):203-213, 2007. [doi]

2006

Black hole search in common interconnection networksStefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro. networks, 47(2):61-71, 2006. [doi]

2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-ToleranceJuraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger. Texts in Theoretical Computer Science. An EATCS Series, Springer, 2005.

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-ToleranceJuraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger. Texts in Theoretical Computer Science. An EATCS Series, Springer, 2005.

2003

On time versus size for monotone dynamic monopolies in regular topologiesPaola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro. jda, 1(2):129-150, 2003. [doi]

Broadcasting with Many Faulty LinksRastislav Kralovic, Richard Královic, Peter Ruzicka. sirocco 2003: 211-222

Minimum feedback vertex sets in shuffle-based interconnection networksRastislav Kralovic, Peter Ruzicka. ipl, 86(4):191-196, 2003. [doi]

2002

Black Hole Search by Mobile Agents in Hypercubes and Related NetworksStefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro. opodis 2002: 169-180

Minimum Feedback Vertex Sets in Shuffle-based Interconnection NetworksRastislav Kralovic, Peter Ruzicka. sirocco 2002: 237-245

2001

On Immunity and Catastrophic Indices of GraphsRastislav Kralovic, Peter Ruzicka. sirocco 2001: 231-242

On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly NetworksMartin Makuch, Peter Ruzicka. sirocco 2001: 243-258

On Efficiency of Path Systems Induced by Routing and Communication SchemesPeter Ruzicka. cai, 20(2):181-205, 2001.

2000

On time versus size for monotone dynamic monopolies in regular topologiesPaola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro. sirocco 2000: 111-125

The complexity of shortest path and dilation bounded interval routingRastislav Kralovic, Peter Ruzicka, Daniel Stefankovic. TCS, 234(1-2):85-107, 2000. [doi]

On the complexity of multi-dimensional interval routing schemesPeter Ruzicka, Daniel Stefankovic. TCS, 245(2):255-280, 2000. [doi]

1999

Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet RoutingRastislav Kralovic, Peter Ruzicka. sirocco 1999: 181-193

Interval Routing on Layered Cross Product of Trees and CyclesRastislav Kralovic, Branislav Rovan, Peter Ruzicka. europar 1999: 1231-1239 [doi]

1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of MessagesKrzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka. ipl, 66(4):181-186, 1998. [doi]

On the Communication Complexity of Strong Time-Optimal Distributed AlgorithmsStefan Dobrev, Peter Ruzicka. njc, 5(2):87-104, 1998.

Time and Bit Optimal Broadcasting on Anonymous Unoriented HypercubesStefan Dobrev, Peter Ruzicka, Gerard Tel. sirocco 1998: 173-187

Broadcasting on Anonymous Unoriented ToriStefan Dobrev, Peter Ruzicka. criwg 1998: 50-62

Yet Another Modular Technique for Efficient Leader ElectionStefan Dobrev, Peter Ruzicka. sofsem 1998: 312-321 [doi]

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection NetworksRastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic. wdag 1998: 273-287 [doi]

Efficient Communication SchemesPeter Ruzicka. sofsem 1998: 244-263 [doi]

1997

Linear Broadcasting and N loglog N Election in Unoriented HypercubesStefan Dobrev, Peter Ruzicka. sirocco 1997: 53-68

The Complexity of Shortest Path and Dilation Bounded Interval RoutingRastislav Kralovic, Peter Ruzicka, Daniel Stefankovic. europar 1997: 258-265

1996

Efficient Tree Pattern UnificationPeter Ruzicka. sofsem 1996: 417-424

1994

Pebbling Dynamic Graphs in Minimal SpacePeter Ruzicka, Juraj Waczulík. ita, 28(6):557-565, 1994.

1993

On Tree Pattern Unification ProblemsPeter Ruzicka, Igor Prívara. fct 1993: 418-429

On Time-Space Trade-Offs in Dynamic Graph PebblingPeter Ruzicka, Juraj Waczulík. mfcs 1993: 671-681

1991

A Note on the Efficiency of an Interval Routing AlgorithmPeter Ruzicka, Vusei-Ar. cj, 34(5):475-476, 1991.

An Efficient Decision Algorithm for the Uniform Semi-Unification ProblemPeter Ruzicka. mfcs 1991: 415-425

1989

An Almost Linear Robinson Unification AlgorithmPeter Ruzicka, Igor Prívara. ACTA, 27(1):61-71, 1989.

1988

On Efficiency of Interval Routing AlgorithmsPeter Ruzicka. mfcs 1988: 492-500

An Almost Linear Robinson Unification ALgorithmPeter Ruzicka, Igor Prívara. mfcs 1988: 501-511

1981

Bounds for on-line selectionPeter Ruzicka. kybernetika, 17(2):147-157, 1981. [doi]

Validity test for Floyd's operator-precedence parsing algorithms is polynomial in timePeter Ruzicka. kybernetika, 17(5):368-379, 1981. [doi]

1980

Time and Space Bounds in Producing Certain Partial OrdersPeter Ruzicka. mfcs 1980: 539-551

1979

Validity Test for Floyd s Operator-Precedence Parsing AlgorithmsPeter Ruzicka. mfcs 1979: 415-424

1977

How Good Is the Adversary Lower Bound?Peter Ruzicka, Juraj Wiedermann. mfcs 1977: 465-474

1976

On the Lower Bound for Minimum Comparison SelectionPeter Ruzicka, Juraj Wiedermann. mfcs 1976: 495-502

1975

Size Complexity of Context-free LanguagesPeter Ruzicka. eik, 11(4-6):296-299, 1975.

Local Disambiguating TransformationPeter Ruzicka. mfcs 1975: 399-404

On the size of DeRemer's analyzersPeter Ruzicka. kybernetika, 11(3):207-217, 1975. [doi]

Sign in or sign up to see more results.

runs on WebDSL