Search the dblp DataBase
Zvi Lotker :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Zvi Lotker , Marc Martinez de Albeniz , Stephane Perennes Range-Free Ranking in Sensors Networks and Its Applications to Localization. [Citation Graph (0, 0)][DBLP ] ADHOC-NOW, 2004, pp:158-171 [Conf ] Stefan Funke , Alexander Kesselman , Zvi Lotker , Michael Segal Improved Approximation Algorithms for Connected Sensor Cover. [Citation Graph (0, 0)][DBLP ] ADHOC-NOW, 2004, pp:56-69 [Conf ] Zvi Lotker , Debapriyo Majumdar , N. S. Narayanaswamy , Ingmar Weber Sequences Characterizing k -Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:216-225 [Conf ] Aubin Jarry , Zvi Lotker Connectivity in evolving graph with geometric properties. [Citation Graph (0, 0)][DBLP ] DIALM-POMC, 2004, pp:24-30 [Conf ] Pierre Fraigniaud , Emmanuelle Lebhar , Zvi Lotker A Doubling Dimension Threshold Theta (loglogn ) for Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:376-386 [Conf ] Alexander Kesselman , Zvi Lotker , Yishay Mansour , Boaz Patt-Shamir Buffer Overflows of Merging Streams. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:349-360 [Conf ] Guy Even , Zvi Lotker , Dana Ron , Shakhar Smorodinsky Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:691-700 [Conf ] Ralf Klasing , Zvi Lotker , Alfredo Navarra , Stephane Perennes From Balls and Bins to Points and Vertices. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:757-766 [Conf ] Zvi Lotker , Alfredo Navarra Managing Random Sensor Networks by means of Grid Emulation. [Citation Graph (0, 0)][DBLP ] Networking, 2006, pp:856-867 [Conf ] Rudi Cilibrasi , Zvi Lotker , Alfredo Navarra , Stephane Perennes , Paul M. B. Vitányi About the Lifespan of Peer to Peer Networks, . [Citation Graph (0, 0)][DBLP ] OPODIS, 2006, pp:290-304 [Conf ] Zvi Lotker , Alfredo Navarra Unbalanced Points and Vertices Problem. [Citation Graph (0, 0)][DBLP ] PerCom Workshops, 2006, pp:96-100 [Conf ] Gady Kozma , Zvi Lotker , Micha Sharir , Gideon Stupp Geometrically aware communication in random wireless networks. [Citation Graph (0, 0)][DBLP ] PODC, 2004, pp:310-319 [Conf ] Zvi Lotker , Boaz Patt-Shamir Average-case analysis of greedy packet scheduling (extended astract). [Citation Graph (0, 0)][DBLP ] PODC, 2000, pp:31-40 [Conf ] Zvi Lotker , Boaz Patt-Shamir Nearly optimal FIFO buffer management for DiffServ. [Citation Graph (0, 0)][DBLP ] PODC, 2002, pp:134-142 [Conf ] Zvi Lotker , Boaz Patt-Shamir , David Peleg Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP ] PODC, 2001, pp:63-71 [Conf ] Jaap-Henk Hoepman , Shay Kutten , Zvi Lotker Efficient Distributed Weighted Matchings on Trees. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2006, pp:115-129 [Conf ] Baruch Awerbuch , Yossi Azar , Zvi Lotker , Boaz Patt-Shamir , Mark R. Tuttle Collaborate with strangers to find own preferences. [Citation Graph (0, 0)][DBLP ] SPAA, 2005, pp:263-269 [Conf ] Alexander Kesselman , Yishay Mansour , Zvi Lotker , Boaz Patt-Shamir Buffer overflows of merging streams. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:244-245 [Conf ] Zvi Lotker , Elan Pavlov , Boaz Patt-Shamir , David Peleg MST construction in O(log log n) communication rounds. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:94-100 [Conf ] Zvi Lotker , Boaz Patt-Shamir , Adi Rosén New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP ] SPAA, 2002, pp:192-199 [Conf ] Zvi Lotker , Boaz Patt-Shamir , Mark R. Tuttle Publish and perish: definition and analysis of an n -person publication impact game. [Citation Graph (0, 0)][DBLP ] SPAA, 2006, pp:11-18 [Conf ] Alexander Kesselman , Zvi Lotker , Yishay Mansour , Boaz Patt-Shamir , Baruch Schieber , Maxim Sviridenko Buffer overflow management in QoS switches. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:520-529 [Conf ] Zvi Lotker , Boaz Patt-Shamir , Mark R. Tuttle Timing Games and Shared Memory. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:507-508 [Conf ] Pierre Fraigniaud , Emmanuelle Lebhar , Zvi Lotker Brief Announcement: On Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:551-553 [Conf ] Zvi Lotker , Boaz Patt-Shamir Nearly optimal FIFO buffer management for two packet classes. [Citation Graph (0, 0)][DBLP ] Computer Networks, 2003, v:42, n:4, pp:481-492 [Journal ] Zvi Lotker , Boaz Patt-Shamir , David Peleg Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2006, v:18, n:6, pp:453-460 [Journal ] Zvi Lotker , Boaz Patt-Shamir A Note on Randomized Mutual Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:5-6, pp:187-191 [Journal ] Khaled Elbassioni , Zvi Lotker , Raimund Seidel Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:69-71 [Journal ] Zvi Lotker , Boaz Patt-Shamir Average-Case Analysis of Greedy Packet Scheduling. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2002, v:35, n:6, pp:667-683 [Journal ] Rajat Bhattacharjee , Ashish Goel , Zvi Lotker Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:34, n:2, pp:318-332 [Journal ] Guy Even , Zvi Lotker , Dana Ron , Shakhar Smorodinsky Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:33, n:1, pp:94-136 [Journal ] Alexander Kesselman , Zvi Lotker , Yishay Mansour , Boaz Patt-Shamir , Baruch Schieber , Maxim Sviridenko Buffer Overflow Management in QoS Switches. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:3, pp:563-583 [Journal ] Zvi Lotker , Boaz Patt-Shamir , Elan Pavlov , David Peleg Minimum-Weight Spanning Tree Construction in O (log log n ) Communication Rounds. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:1, pp:120-131 [Journal ] Zvi Lotker , Boaz Patt-Shamir , Adi Rosén New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:2, pp:286-303 [Journal ] Harry Buhrman , Matthias Christandl , Michal Koucký , Zvi Lotker , Boaz Patt-Shamir , Nikolai K. Vereshchagin High Entropy Random Selection Protocols. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2007, pp:366-379 [Conf ] Zvi Lotker , Boaz Patt-Shamir , Adi Rosén Distributed approximate matching. [Citation Graph (0, 0)][DBLP ] PODC, 2007, pp:167-174 [Conf ] Pierre Fraigniaud , Cyril Gavoille , Adrian Kosowski , Emmanuelle Lebhar , Zvi Lotker Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP ] SPAA, 2007, pp:1-7 [Conf ] Rudi Cilibrasi , Zvi Lotker , Alfredo Navarra , Stéphane Pérennes , Paul M. B. Vitányi About the Lifespan of Peer to Peer Networks [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Stefan Funke , Sören Laue , Zvi Lotker , Rouven Naujoks Power Assignment Problems in Wireless Communication [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Paul M. B. Vitányi , Zvi Lotker Tales of Huffman [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Stefan Funke , Alexander Kesselman , Fabian Kuhn , Zvi Lotker , Michael Segal Improved approximation algorithms for connected sensor cover. [Citation Graph (0, 0)][DBLP ] Wireless Networks, 2007, v:13, n:2, pp:153-164 [Journal ] A Note on Uniform Power Connectivity in the SINR Model. [Citation Graph (, )][DBLP ] High Entropy Random Selection Protocols. [Citation Graph (, )][DBLP ] Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours. [Citation Graph (, )][DBLP ] On the Connectivity Threshold for General Uniform Matric Space. [Citation Graph (, )][DBLP ] Radio cover time in hyper-graphs. [Citation Graph (, )][DBLP ] On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. [Citation Graph (, )][DBLP ] How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). [Citation Graph (, )][DBLP ] Unit disk graph and physical interference model: Putting pieces together. [Citation Graph (, )][DBLP ] SINR diagrams: towards algorithmically usable SINR models of wireless networks. [Citation Graph (, )][DBLP ] Recovering the Long-Range Links in Augmented Graphs. [Citation Graph (, )][DBLP ] Distributed Weighted Stable Marriage Problem. [Citation Graph (, )][DBLP ] Improved distributed approximate matching. [Citation Graph (, )][DBLP ] Many random walks are faster than one. [Citation Graph (, )][DBLP ] Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. [Citation Graph (, )][DBLP ] From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. [Citation Graph (, )][DBLP ] Grid emulation for managing random sensor networks. [Citation Graph (, )][DBLP ] Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices [Citation Graph (, )][DBLP ] Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental [Citation Graph (, )][DBLP ] SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks [Citation Graph (, )][DBLP ] A note on uniform power connectivity in the SINR model [Citation Graph (, )][DBLP ] Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs) [Citation Graph (, )][DBLP ] Tight Bounds for Algebraic Gossip on Graphs [Citation Graph (, )][DBLP ] Search in 0.131secs, Finished in 0.136secs