Search Results - "Krizanc, D."

Monitoring the Plane with Rotating Radars by Czyzowicz, J., Dobrev, S., Joeris, B., Kranakis, E., Krizanc, D., Maňuch, J., Morales-Ponce, O., Opatrny, J., Stacho, L., Urrutia, J.

“…Consider a set P of n points in the plane and n radars located at these points. The radars are rotating perpetually (around their centre) with identical…”
Get full text

A reservation-based multicast protocol for WDM optical star networks by Naik, K., Wei, D.S.L., Krizanc, D., Kuo, S.-Y.

“…In this paper, we present a reservation-based medium access control (MAC) protocol with multicast support for wavelength-division multiplexing networks. Our…”
Get full text

Priority evacuation from a disk: The case of n ≥ 4 by Czyzowicz, J., Georgiou, K., Killick, R., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.

“…We introduce and study a new search-type problem with (n+1)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed,…”
Get full text

Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency by Clote, Peter, Ferré, Fabrizio, Kranakis, Evangelos, Krizanc, Danny

“…We present results of computer experiments that indicate that several RNAs for which the native state (minimum free energy secondary structure) is functionally…”
Get full text

On Recognizing a String on an Anonymous Ring by Kranakis, E., Krizanc, D., Luccio, F. L.

“…We consider the problem of recognizing whether a given binary string of length n is equal (up to rotation) to the input of an anonymous oriented ring of n…”
Get full text

Asynchronous deterministic rendezvous in graphs by Marco, Gianluca De, Gargano, Luisa, Kranakis, Evangelos, Krizanc, Danny, Pelc, Andrzej, Vaccaro, Ugo

“…Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph have to meet. We consider the asynchronous…”
Get full text

Fast deterministic selection on mesh-connected processor arrays by Krizanc, D., Narayanan, L., Raman, R.

Get full text

Power consumption in packet radio networks by Kirousis, Lefteris M., Kranakis, Evangelos, Krizanc, Danny, Pelc, Andrzej

“…In this paper we study the problem of assigning transmission ranges to the nodes of a multi-hop packet radio network so as to minimize the total power consumed…”
Get full text

New graph decompositions with applications to emulations by Kaklamanis, C., Krizanc, D., Rao, S.

“…In this paper we present a new type of graph decomposition calleda cut-cover that combines the notions of graph separators andt-neighborhood covers. We show…”
Get full text

Sorting multisets in anonymous rings by Flocchini, P, Kranakis, E, Krizanc, D, Luccio, Flaminia L, Santoro, N

“…An anonymous ring network is a ring where all processors (vertices) are totally indistinguishable except for their input value. Initially, to each vertex of…”
Get full text

Dynamic interval routing on asynchronous rings by Krizanc, D., Luccio, F.L., Raman, R.

“…We consider the problem of routing in an asynchronous dynamically changing ring of processors using schemes that minimize the storage space for the routing…”
Get full text

Asymptotics of canonical and saturated RNA secondary structures by Clote, Peter, Kranakis, Evangelos, Krizanc, Danny, Salvy, Bruno

“…It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is 1.104366 . n(-3/2) . 2.618034(n). In this paper, we…”
Get more information

The impact of information on broadcasting time in linear radio networks by Diks, Krzysztof, Kranakis, Evangelos, Krizanc, Danny, Pelc, Andrzej

“…We consider the problem of distributed deterministic broadcasting in radio networks whose nodes are located on a line. Nodes send messages in synchronous…”
Get full text

Efficient Update Strategies for Geometric Computing with Uncertainty by Bruce, Richard, Hoffmann, Michael, Krizanc, Danny, Raman, Rajeev

“…We consider the problems of computing maximal points and the convex hull of a set of points in two dimensions, when the points are "in motion." We assume that…”
Get full text

Rigorous results for random [formula omitted]-SAT by Achlioptas, Dimitris, Kirousis, Lefteris M., Kranakis, Evangelos, Krizanc, Danny

“…In recent years there has been significant interest in the study of random k-SAT formulae. For a given set of n Boolean variables, let B k denote the set of…”
Get full text

A survey of randomness and parallelism in comparison problems by Krizanc, Danny

“…A survey of results for the problems of selection, merging and sorting in the Randomized Parallel Comparison Tree (RPCT) model is given. The results indicate…”
Get full text

Sorting and election in anonymous asynchronous rings by Flocchini, Paola, Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia L., Santoro, Nicola

“…In an anonymous ring of n processors, all processors are totally indistinguishable except for their input values. These values are not necessarily distinct,…”
Get full text

Approximating the unsatisfiability threshold of random formulas by Kirousis, Lefteris M., Kranakis, Evangelos, Krizanc, Danny, Stamatiou, Yannis C.

“…Let ϕ be a random Boolean formula that is an instance of 3‐SAT. We consider the problem of computing the least real number κ such that if the ratio of the…”
Get full text

On realizing shapes in the theory of RNA neutral networks by Clote, Peter, Gąsieniec, Leszek, Kolpakov, Roman, Kranakis, Evangelos, Krizanc, Danny

“…It is known (Reidys et al., 1997b. Bull. Math. Biol. 59(2), 339–397) that for any two secondary structures S , S ′ there exists an RNA sequence compatible with…”
Get full text

Graph Exploration by Energy-Sharing Mobile Agents by Czyzowicz, J, Dobrev, S, Killick, R, Kranakis, E, Krizanc, D, Narayanan, L, Opatrny, J, Pankratov, D, Shende, S

“…We consider the problem of collective exploration of a known $n$-node edge-weighted graph by $k$ mobile agents that have limited energy but are capable of…”
Get full text