The following pages link to Sotiris E. Nikoletseas (Q518675):
Displayed 28 items.
- (Q4536928) (← links)
- Expander properties in random regular graphs with edge faults (Q4596641) (← links)
- Strategic Contention Resolution with Limited Feedback (Q4606299) (← links)
- Stably Computing Order Statistics with Arithmetic Population Protocols (Q4608631) (← links)
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing (Q4632452) (← links)
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175) (← links)
- (Q4668736) (← links)
- (Q4708560) (← links)
- (Q4785581) (← links)
- (Q4788605) (← links)
- (Q4791664) (← links)
- (Q4813181) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs (Q5092333) (← links)
- Determining Majority in Networks with Local Interactions and Very Small Local Memory (Q5167799) (← links)
- CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS (Q5249039) (← links)
- Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation (Q5307524) (← links)
- A Guided Tour in Random Intersection Graphs (Q5327420) (← links)
- Probabilistic Data Propagation in Wireless Sensor Networks (Q5391121) (← links)
- Energy-Balanced Data Propagation inWireless Sensor Networks (Q5391127) (← links)
- The Survival of the Weakest in Networks (Q5443530) (← links)
- Automata, Languages and Programming (Q5466535) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897975) (← links)
- Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networks (Q6051508) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Selected combinatorial problems through the prism of random intersection graphs models (Q6057306) (← links)
- A spectral algorithm for finding maximum cliques in dense random intersection graphs (Q6114455) (← links)
- (Q6147529) (← links)
- Near-optimal dominating sets in dense random graphs in polynomial expected time (Q6184387) (← links)