| 2009 |
| 57 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability.
Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) |
| 2008 |
| 56 | EE | Stefan Funke,
Sören Laue,
Rouven Naujoks,
Zvi Lotker:
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours.
DCOSS 2008: 282-295 |
| 55 | EE | Chen Avin,
Michal Koucký,
Zvi Lotker:
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs).
ICALP (1) 2008: 121-132 |
| 54 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
Recovering the Long-Range Links in Augmented Graphs.
SIROCCO 2008: 104-118 |
| 53 | EE | Noga Alon,
Chen Avin,
Michal Koucký,
Gady Kozma,
Zvi Lotker,
Mark R. Tuttle:
Many random walks are faster than one.
SPAA 2008: 119-128 |
| 52 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Seth Pettie:
Improved distributed approximate matching.
SPAA 2008: 129-136 |
| 51 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Dror Rawitz:
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental.
STACS 2008: 503-514 |
| 50 | EE | Zvi Lotker,
Alfredo Navarra:
Grid emulation for managing random sensor networks.
Ad Hoc Networks 6(6): 900-908 (2008) |
| 49 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Dror Rawitz:
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
CoRR abs/0802.2832: (2008) |
| 48 | EE | Chen Avin,
Yuval Emek,
Erez Kantor,
Zvi Lotker,
David Peleg,
Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks
CoRR abs/0811.3284: (2008) |
| 47 | EE | Josep Díaz,
Zvi Lotker,
Maria J. Serna:
The distant-2 chromatic number of random proximity and random geometric graphs.
Inf. Process. Lett. 106(4): 144-148 (2008) |
| 46 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Dror Rawitz:
Ski rental with two general options.
Inf. Process. Lett. 108(6): 365-368 (2008) |
| 45 | EE | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst. 42(1): 27-41 (2008) |
| 2007 |
| 44 | EE | Harry Buhrman,
Matthias Christandl,
Michal Koucký,
Zvi Lotker,
Boaz Patt-Shamir,
Nikolai K. Vereshchagin:
High Entropy Random Selection Protocols.
APPROX-RANDOM 2007: 366-379 |
| 43 | EE | Nikolai K. Vereshchagin,
Harry Buhrman,
Matthias Christandl,
Michal Koucký,
Zvi Lotker,
Boaz Patt-Shamir:
High Entropy Random Selection Protocols.
Algebraic Methods in Computational Complexity 2007 |
| 42 | | Gady Kozma,
Zvi Lotker,
Gideon Stupp:
On the Connectivity Threshold for General Uniform Matric Space.
DIALM-POMC 2007 |
| 41 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
Distributed approximate matching.
PODC 2007: 167-174 |
| 40 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
SPAA 2007: 1-7 |
| 39 | EE | Stefan Funke,
Alexander Kesselman,
Fabian Kuhn,
Zvi Lotker,
Michael Segal:
Improved approximation algorithms for connected sensor cover.
Wireless Networks 13(2): 153-164 (2007) |
| 2006 |
| 38 | EE | Zvi Lotker,
Debapriyo Majumdar,
N. S. Narayanaswamy,
Ingmar Weber:
Sequences Characterizing k-Trees.
COCOON 2006: 216-225 |
| 37 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
Brief Announcement: On Augmented Graph Navigability.
DISC 2006: 551-553 |
| 36 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.
ESA 2006: 376-386 |
| 35 | EE | Zvi Lotker,
Alfredo Navarra:
Managing Random Sensor Networks by means of Grid Emulation.
Networking 2006: 856-867 |
| 34 | EE | Rudi Cilibrasi,
Zvi Lotker,
Alfredo Navarra,
Stephane Perennes,
Paul M. B. Vitányi:
About the Lifespan of Peer to Peer Networks, .
OPODIS 2006: 290-304 |
| 33 | EE | Zvi Lotker,
Alfredo Navarra:
Unbalanced Points and Vertices Problem.
PerCom Workshops 2006: 96-100 |
| 32 | EE | Jaap-Henk Hoepman,
Shay Kutten,
Zvi Lotker:
Efficient Distributed Weighted Matchings on Trees.
SIROCCO 2006: 115-129 |
| 31 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Publish and perish: definition and analysis of an n-person publication impact game.
SPAA 2006: 11-18 |
| 30 | EE | Rudi Cilibrasi,
Zvi Lotker,
Alfredo Navarra,
Stéphane Pérennes,
Paul M. B. Vitányi:
About the Lifespan of Peer to Peer Networks
CoRR abs/cs/0612043: (2006) |
| 29 | EE | Stefan Funke,
Sören Laue,
Zvi Lotker,
Rouven Naujoks:
Power Assignment Problems in Wireless Communication
CoRR abs/cs/0612121: (2006) |
| 28 | EE | Paul M. B. Vitányi,
Zvi Lotker:
Tales of Huffman
CoRR abs/cs/0612133: (2006) |
| 27 | EE | Zvi Lotker,
Boaz Patt-Shamir,
David Peleg:
Distributed MST for constant diameter graphs.
Distributed Computing 18(6): 453-460 (2006) |
| 26 | EE | Khaled M. Elbassioni,
Zvi Lotker,
Raimund Seidel:
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.
Inf. Process. Lett. 100(2): 69-71 (2006) |
| 2005 |
| 25 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Timing Games and Shared Memory.
DISC 2005: 507-508 |
| 24 | EE | Ralf Klasing,
Zvi Lotker,
Alfredo Navarra,
Stephane Perennes:
From Balls and Bins to Points and Vertices.
ISAAC 2005: 757-766 |
| 23 | EE | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with strangers to find own preferences.
SPAA 2005: 263-269 |
| 22 | EE | Khaled M. Elbassioni,
Zvi Lotker,
Raimund Seidel:
Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices
CoRR abs/cs/0507038: (2005) |
| 21 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Elan Pavlov,
David Peleg:
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds.
SIAM J. Comput. 35(1): 120-131 (2005) |
| 2004 |
| 20 | EE | Zvi Lotker,
Marc Martinez de Albeniz,
Stephane Perennes:
Range-Free Ranking in Sensors Networks and Its Applications to Localization.
ADHOC-NOW 2004: 158-171 |
| 19 | EE | Stefan Funke,
Alexander Kesselman,
Zvi Lotker,
Michael Segal:
Improved Approximation Algorithms for Connected Sensor Cover.
ADHOC-NOW 2004: 56-69 |
| 18 | EE | Aubin Jarry,
Zvi Lotker:
Connectivity in evolving graph with geometric properties.
DIALM-POMC 2004: 24-30 |
| 17 | EE | Gady Kozma,
Zvi Lotker,
Micha Sharir,
Gideon Stupp:
Geometrically aware communication in random wireless networks.
PODC 2004: 310-319 |
| 16 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
New stability results for adversarial queuing.
SIAM J. Comput. 33(2): 286-303 (2004) |
| 15 | EE | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir,
Baruch Schieber,
Maxim Sviridenko:
Buffer Overflow Management in QoS Switches.
SIAM J. Comput. 33(3): 563-583 (2004) |
| 14 | EE | Rajat Bhattacharjee,
Ashish Goel,
Zvi Lotker:
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model.
SIAM J. Comput. 34(2): 318-332 (2004) |
| 2003 |
| 13 | EE | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir:
Buffer Overflows of Merging Streams.
ESA 2003: 349-360 |
| 12 | EE | Alexander Kesselman,
Yishay Mansour,
Zvi Lotker,
Boaz Patt-Shamir:
Buffer overflows of merging streams.
SPAA 2003: 244-245 |
| 11 | EE | Zvi Lotker,
Elan Pavlov,
Boaz Patt-Shamir,
David Peleg:
MST construction in O(log log n) communication rounds.
SPAA 2003: 94-100 |
| 10 | EE | Zvi Lotker,
Boaz Patt-Shamir:
Nearly optimal FIFO buffer management for two packet classes.
Computer Networks 42(4): 481-492 (2003) |
| 9 | EE | Guy Even,
Zvi Lotker,
Dana Ron,
Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
SIAM J. Comput. 33(1): 94-136 (2003) |
| 2002 |
| 8 | EE | Guy Even,
Zvi Lotker,
Dana Ron,
Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
FOCS 2002: 691-700 |
| 7 | EE | Zvi Lotker,
Boaz Patt-Shamir:
Nearly optimal FIFO buffer management for DiffServ.
PODC 2002: 134-142 |
| 6 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Adi Rosén:
New stability results for adversarial queuing.
SPAA 2002: 192-199 |
| 5 | EE | Zvi Lotker,
Boaz Patt-Shamir:
Average-Case Analysis of Greedy Packet Scheduling.
Theory Comput. Syst. 35(6): 667-683 (2002) |
| 2001 |
| 4 | EE | Zvi Lotker,
Boaz Patt-Shamir,
David Peleg:
Distributed MST for constant diameter graphs.
PODC 2001: 63-71 |
| 3 | EE | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir,
Baruch Schieber,
Maxim Sviridenko:
Buffer overflow management in QoS switches.
STOC 2001: 520-529 |
| 2000 |
| 2 | EE | Zvi Lotker,
Boaz Patt-Shamir:
Average-case analysis of greedy packet scheduling (extended astract).
PODC 2000: 31-40 |
| 1999 |
| 1 | EE | Zvi Lotker,
Boaz Patt-Shamir:
A Note on Randomized Mutual Search.
Inf. Process. Lett. 71(5-6): 187-191 (1999) |