The following pages link to D. Krizanc (Q215101):
Displaying 50 items.
- (Q2766883) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points (Q2894470) (← links)
- The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs (Q2907495) (← links)
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs (Q2945178) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs (Q3066172) (← links)
- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle (Q3066444) (← links)
- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations (Q3066467) (← links)
- BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS (Q3166746) (← links)
- STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE (Q3166749) (← links)
- (Q3181699) (← links)
- Randomized rendezvous with limited memory (Q3189017) (← links)
- God save the queen (Q3305734) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Q3459874) (← links)
- Balancing Traffic Load Using One-Turn Rectilinear Routing (Q3502670) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Mobile Agent Rendezvous in a Synchronous Torus (Q3525798) (← links)
- String recognition on anonymous rings (Q3569028) (← links)
- Maximum Interference of Random Sensors on a Line (Q3569126) (← links)
- An Algorithmic Theory of Mobile Agents (Q3608454) (← links)
- The Average Complexity of Parallel Comparison Merging (Q3990098) (← links)
- (Q4038697) (← links)
- (Q4234101) (← links)
- Baked-Potato Routing (Q4238534) (← links)
- Approximating the unsatisfiability threshold of random formulas (Q4240602) (← links)
- (Q4326201) (← links)
- Hop-Congestion Trade-Offs for High-Speed Networks (Q4358514) (← links)
- (Q4375776) (← links)
- (Q4385172) (← links)
- Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (Q4432766) (← links)
- (Q4436057) (← links)
- (Q4472476) (← links)
- (Q4474141) (← links)
- Distributed Online Frequency Assignment in Cellular Networks (Q4500850) (← links)
- (Q4504023) (← links)
- Lower bounds for compact routing (Q4593958) (← links)
- Approximating the unsatisfiability threshold of random formulas (Extended Abstract) (Q4595474) (← links)
- Search on a Line by Byzantine Robots (Q4636509) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- (Q4788596) (← links)
- (Q4817649) (← links)
- Time-Randomness Trade-offs in Parallel Computation (Q4864432) (← links)
- On Multi-Label Linear Interval Routing Schemes (Q4886687) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- (Q4938771) (← links)
- (Q4942228) (← links)
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks (Q4943847) (← links)
