The following pages link to Danny Krizanc (Q215101):
Displaying 50 items.
- (Q169863) (redirect page) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q518925) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- Integer sorting on a mesh-connected array of processors (Q688438) (← links)
- Maintaining privacy on a line (Q692927) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- Compact routing schemes for dynamic ring networks (Q705135) (← links)
- On realizing shapes in the theory of RNA neutral networks (Q776594) (← links)
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model (Q876474) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Memoryless search algorithms in a network with faulty advice (Q935471) (← links)
- Realizing partitions respecting full and partial order information (Q954955) (← links)
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Approximate maxima finding of continuous functions under restricted budget (Q1274326) (← links)
- Optimal coteries and voting schemes (Q1328755) (← links)
- Computing Boolean functions on anonymous networks (Q1341773) (← links)
- Stage-graph representations (Q1363763) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Sorting and election in anonymous asynchronous rings. (Q1427459) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- Power consumption in packet radio networks (Q1575645) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Priority evacuation from a disk using mobile robots (extended abstract) (Q1713933) (← links)
- Evacuation from a disc in the presence of a faulty robot (Q1742766) (← links)
- Asymmetric communication protocols via hotlink assignments (Q1762995) (← links)
- The impact of information on broadcasting time in linear radio networks. (Q1853489) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Labeled versus unlabeled distributed Cayley networks (Q1917232) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- The pony express communication problem (Q2115855) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- The bike sharing problem (Q2232233) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Satisfying neighbor preferences on a circle (Q2294731) (← links)
- Weak coverage of a rectangular barrier (Q2300721) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Excuse me! or the courteous theatregoers' problem (Q2347004) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Approximate hotlink assignment (Q2390237) (← links)
- Asymptotic number of hairpins of saturated RNA secondary structures (Q2446792) (← links)
- Efficient automatic simulation of parallel computation on networks of workstations (Q2492225) (← links)
- (Q2728846) (← links)
- (Q2729093) (← links)
- Fault-Tolerant Broadcasting in Radio Networks (Q2731601) (← links)
- (Q2752519) (← links)
- Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval (Q2765224) (← links)
