General Information
NameProf. Zvi Lotker
DepartmentDepartment of Communication Systems Engineering
Emailzvilo@bgu.ac.il
Academic RankLecturer


Journal Articles

 
[1] Lotker Z., Universal augmentation schemes for network navigability, Theoretical Computer Science, 410, 21-23, 1961-2300, (2009).
[2] Lotker Z., Patt-Shamir B., Tuttle M.R., A game of timing and visibility, Games Econ. Behav. (USA), 62, 2, 643 - 60, (2008).
[3] Diaz J., Lotker Z., Serna M., The distant-2 chromatic number of random proximity and random geometric graphs, Inf. Process. Lett. (Netherlands), 106, 4, 144 - 8, (2008).
[4] Lotker Z., Grid emulation for managing random sensor networks. , Ad Hoc Networks, 6(6):, 900-908, (2008).
[5] Lotker Z., Ski rental with two general options, Information Processing Letters , 108, 6, 365-368, (2008).
[6] Lotker Z., Note on deleting a vertex and weak interlacing of the Laplacian spectrum, Electron. J. Linear Algebra, (2007).
[7] Funke Stefan, Kesselman Alex, Kuhn Fabian, Lotker Z., Improved Algorithms for the Connected Sensor Cover Problem, ACM Wireless Networks, 13, 2, 153-164, (2007).
[8] Kozma Gady, Lotker Z., Gideon Stupp, Minimum Spanning Tree and upper box dimension, Proc. Amer. Math. Soc, 134, 1183-1187, (2006).
[9] Lotker Z., Patt-shamir Boaz, Peleg David, Distributed MST for Constant Diameter Graphs, Distributed Computing, 18, 6, 453-460, (2006).
[10] Elbassioni Khaled, Lotker Z., Seidel Raimund, Upper Bound Theorem for Polyhedra with 0, 1-constraint matrices, Information. Process. Letters, 100, 2, 69-71, (2006).
[11] Lotker Z., Patt-Shamir B., Pavlov E., Peleg D., Minimum-weight spanning tree construction in O(log log n) communication rounds, SIAM Journal on Computing, 35, 1, 120 - 131, (2006).
[12] Elbassioni K., Lotker Z., Seidel R., Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices, Information Processing Letters, 100, 2, 69 - 71, (2006).
[13] Lotker Z., Elbassioni K., Seidel R., Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices, Inf. Process. Lett. (Netherlands), 100, 2, 69 - 71, (2006).
[14] Lotker Z., Patt-shamir Boaz, Pavlov Elan, Peleg David, MST Construction in O(log log n) Communication Rounds, SIAM J. Computing, 35, 1, 120-131, (2005).
[15] Funke S., Kesselman A., Kuhn Fabian, Lotker Z., Improved approximation algorithms for connected sensor cover, ACM Trans on Wireless Networks, 3158, 1022-0038, (2004).
[16] Lotker Z., Patt-shamir Boaz, Rosen Adi, New Stability Results for Adversarial Queuing, SIAM J. Computing, 33, 2, 286-303, (2004).
[17] Kesselman Alexander, Lotker Z., Mansour Yishay, Patt-shamir Boaz, Schieber Baruch, Sviridenko Maxim, Buffer Overflow Management in QoS Switches, SIAM Journal on Computing, 33, 3, 563-583, (2004).
[18] Bhattacharjee Rajat, Goel Ashish, Lotker Z., Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model, SIAM Journal on Computing, 34, 2, 318-332, (2004).
[19] Coppersmith Don, Lotker Z., On Cayley''s Formula For Counting Trees In Nested Interval graphs, Electron. J. Linear Algebra, 11, 241-245, (2004).
[20] Lotker Z., Nearly Optimal FIFO Buffer Management for DiffServ, Computer Networks Journal, 42, 4, 481-492, (2003).
[21] Even Guy, Lotker Z., Ron Dana, Smorodinsky Shakhar, Conffict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks, SIAM J. Computing, 33, 1, 94-136, (2003).
[22] Lotker Z., Patt-Shamir B., Nearly optimal FIFO buffer management for two packet classes, Computer Networks, 42, 4, 481 - 492, (2003).
[23] Lotker Z., Patt-shamir Boaz, Average-Case Analysis of Greedy Packet Scheduling, Theory of Computing Systems, 35, 6, 667-683, (2002).
[24] Lotker Z., Patt-shamir Boaz, A Note on Randomized Mutual Search, Information Processing Letters, 71, 5-6, 187-192, (1999).
[25] Awerbuch Baruch, Azar Yossi, Lotker Z., Patt-shamir Boaz, Tuttle Mark, Collaborate With Strangers To Find Own Preferences, Theory of Computing Systems., (0).

Show All
   

To the top

Conference Proceedings

 
[1] Lotker Z., Zvi Lotker, Boaz Patt-Shamir, Adi Ros?n: Distributed approximate matching. PODC 2007: 167-174, (2007).
[2] Lotker Z., 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, (2007).
[3] Lotker Z., Harry Buhrman, Matthias Christandl, Michal Kouck?, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin: High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379, (2007).
[4] Lotker Z., Navarra Alfredo, Grid Emulation using Collision-Free Sensor Network Routing, Networking 2006, pages 856-867, (2006).
[5] Hoepman Jaap-henk, Kutten Shay, Lotker Z., Randomised Distributed Weighted Matchings on Trees, Sirocco 2006, (2006).
[6] Lotker Z., Majumdar Debapriyo, Narayanaswamy N.s., Weber Ingmar, k-tree Characterizing Sequences, Cocoon 2006, (2006).
[7] Lotker Z., Patt-shamir Boaz, Tuttle Mark, Publish and Perish: Definition and Analysis of an n-Person Publication Impact Game, SPAA 2006, (2006).
[8] Fraigniaud Pierre, Lebhar Emmanuelle, Lotker Z., A Doubling Dimension Threshold £(log log n) for Augmented Graph Navigability, ESA 2006, (2006).
[9] Lotker Z., Navarra A., Managing random sensor networks by means of grid emulation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 856 - 867, (2006).
[10] Lotker Z., Majumdar D., Narayanaswamy N.S., Weber I., Sequences characterizing k-Trees, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),Computing and Combinatorics. 12th Annual International Conference, COCOON 2006. Proceedings (Lecture Notes in Computer Science Vol.4112), 216 - 225, (2006).
[11] Fraigniaud P., Lebhar E., Lotker Z., Brief announcement: On augmented graph navigability, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 551 - 553, (2006).
[12] Lotker Z., Navarra A., Unbalanced points and vertices problem, Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006, 96 - 100, (2006).
[13] Cilibrasi R., Lotker Z., Navarra A., Perennes S., Vitanyi P., About the lifespan of peer to peer networks, Principles of Distributed Systems. 10th International Conference, OPODIS 2006. Proceedings (Lecture Notes in Computer Science Vol. 4305), 290 - 304, (2006).
[14] Awerbuch Baruch, Azar Yossi, Lotker Z., Patt-shamir Boaz, Tuttle Mark r., Collaborate With Strangers To Find Own Preferences, The 17th Annual ACM Symposium on Parallel Algorithms (SPAA 2005), (2005).
[15] Klasing Ralf, Lotker Z., Navarra Alfredo, From Balls and Bins to Points and Vertices, Algorithms and Computation, 16th International Symposium, (ISAAC 2005), Computer Science 3827 Springer, pages: 757-766, (2005).
[16] Lotker Z., Patt-Shamir B., Tuttle M.R., Timing games and shared memory, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),Distributed Computing. 19th International Conference, DISC 2005. Proceedings (Lecture Notes in Computer Science Vol. 3724), 507 - 508, (2005).
[17] Lotker Z., Navarra A., Unbalanced points and vertices problem, Proceedings. Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshop-PerCom Workshop 2006, 5 pp. -, (2005).
[18] Funke S, Kesselman A, Lotker Z., Improved Approximation Algorithms for Connected Sensor Cover, 3rd International Conference on AD HOC Networks and Wireless Computing (AD-HOC NOW). Computer Science, (2004).
[19] Lotker Z., Martinez de albeniz Marc, Perennes Stephane, Range-Free Ranking in Sensors networks and it''s application to Localization, Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, (ADHOC-NOW 2004), Computer Science 3158 Springer, pages: 158-171, (2004).
[20] Jarry Aubin, Lotker Z., Connectivity in Evolving Graph with Geometric Properties, The 8th ACM Annual DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM 2004), (2004).
[21] Kozma Gady, Lotker Z., Sharir Micha, Stupp Gideon, Geometrically Aware Communication in Random Wireless Networks, The 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), (2004).
[22] Lotker Z., Albeniz M.M.de., Perennes S., Range-free ranking in sensors networks and its applications to localization, Ad-Hoc, Mobile and Wireless Networks. Third International Conference, ADHOC-NOW 2004. Proceedings (Lecture Notes in Comput. Sci. Vol.3158), 158 - 71, (2004).
[23] Kesselman Alexander, Lotker Z., Mansour Yishay, Patt-shamir Boaz, Buffer Overflows of Merging Streams, The 11th Annual European Symposium (ESA 2003), Computer Science 2832, Pages: 349-360, (2003).
[24] Lotker Z., Patt-shamir Boaz, Pavlov Elan, Peleg David, MST Construction in O(log log n) Communication Rounds, The 15th Annual ACM Symposium on Parallel Algorithms (SPAA 2003), (2003).
[25] Lotker Z., Patt-shamir Boaz, Nearly Optimal FIFO Buffer Management for DiffServ, The Twenty-First Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), (2002).
[26] Even Guy, Lotker Z., Ron Dana, Smorodinsky Shakhar, Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks, 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), (2002).
[27] Lotker Z., Rosen Adi, Patt-shamir Boaz, New Stability Results for Adversarial Queuing, The 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), (2002).
[28] Kesselman Alexander, Lotker Z., Mansour Yishay, Patt-shamir Boaz, Schieber Baruch, Sviridenko Maxim, Buffer Overflow Management in QoS Switches, The 33rd Annual ACM Symposium on Theory of Computing(STOC 2001), (2001).
[29] Lotker Z., Patt-shamir Boaz, Peleg David, Distributed MST for Constant Di-ameter Graphs, The 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), (2001).
[30] Lotker Z., Patt-shamir Boaz, Average-Case Analysis of Greedy Packet Scheduling, The 19th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2000), (2000).
[31] Cilibrasi Rudi, Lotker Z., Navarra Alfredo, Perennes Stephane, Vitanyi Paul, Lifespan of Peer to Peer Networks: models and insight, The 10th International Conference On Principles Of Distributed Systems, (0).

Show All