Zvi Lotker

According to our database1, Zvi Lotker authored at least 147 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The topology of wireless communication on a line.
Theor. Comput. Sci., 2018

Cover time and mixing time of random walks on dynamic graphs.
Random Struct. Algorithms, 2018

Fault-Tolerant Hotelling Games.
CoRR, 2018

Big data interpolation using functional representation.
Acta Inf., 2018

Preferential Attachment as a Unique Equilibrium.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Random Walks with Multiple Step Lengths.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
On the power of uniform power: capacity of wireless networks with bounded resources.
Wireless Networks, 2017

Distributed computing on core-periphery networks: Axiom-based design.
J. Parallel Distrib. Comput., 2017

The Effect of Population Control Policies on Societal Fragmentation.
CoRR, 2017

Assortative Mixing Equilibria in Social Network Games.
CoRR, 2017

SINR diagram with interference cancellation.
Ad Hoc Networks, 2017

Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Assortative Mixing Equilibria in Social Network Games.
Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

The Effect of Population Control Policies on Societal Fragmentation.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
SplayNet: Towards Locally Self-Adjusting Networks.
IEEE/ACM Trans. Netw., 2016

On social networks of program committees - Structure and effect on paper acceptance fairness.
Social Netw. Analys. Mining, 2016

Distance in the Forest Fire Model How far are you from Eve?
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.
Proceedings of the Structural Information and Communication Complexity, 2016

The tale of two clocks.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Core-periphery clustering and collaboration networks.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Probabilistic connectivity threshold for directional antenna widths.
Theor. Comput. Sci., 2015

Self-adjusting grid networks to minimize expected path length.
Theor. Comput. Sci., 2015

Improved Distributed Approximate Matching.
J. ACM, 2015

The Topology of Wireless Communication.
J. ACM, 2015

Random Preferential Attachment Hypergraphs.
CoRR, 2015

Nonuniform SINR+Voroni Diagrams Are Effectively Uniform.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Homophily and the Glass Ceiling Effect in Social Networks.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Core Size and Densification in Preferential Attachment Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Voting algorithm in the play Julius Caesar.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Social Network Analysis of Program Committees and Paper Acceptance Fairness.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Bounds for algebraic gossip on graphs.
Random Struct. Algorithms, 2014

Testing the irreducibility of nonsquare Perron-Frobenius systems.
Inf. Process. Lett., 2014

Big Data Representation as High Dimensional Configuration.
CoRR, 2014

Core-Periphery in Networks: An Axiomatic Approach.
CoRR, 2014

Distributed Computing on Core-Periphery Networks: Axiom-based Design.
CoRR, 2014

Radio cover time in hyper-graphs.
Ad Hoc Networks, 2014

Distributed Computing on Core-Periphery Networks: Axiom-Based Design.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Order optimal information spreading using algebraic gossip.
Distributed Computing, 2013

SINR Diagram with Interference Cancellation.
CoRR, 2013

Generalized Perron-Frobenius Theorem for Nonsquare Matrices.
CoRR, 2013

Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks.
Ad Hoc Networks, 2013

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Probabilistic Connectivity Threshold for Directional Antenna Widths - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2013

Self-adjusting Grid Networks to Minimize Expected Path Length.
Proceedings of the Structural Information and Communication Complexity, 2013

Locally Self-Adjusting Tree Networks.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Distributed Verification Using Mobile Agents.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model.
Theor. Comput. Sci., 2012

Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental.
SIAM J. Discrete Math., 2012

SINR Diagrams: Convexity and Its Applications in Wireless Networks.
J. ACM, 2012

Data Interpolation: An Efficient Sampling Alternative for Big Data Aggregation
CoRR, 2012

Collaborative Search on the Plane without Communication
CoRR, 2012

Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

SINR diagram with interference cancellation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Collaborative search on the plane without communication.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Optimal virtual traffic light placement.
Proceedings of the FOMC'12, 2012

Big Data Interpolation an Efficient Sampling Alternative for Sensor Data Aggregation.
Proceedings of the Algorithms for Sensor Systems, 2012

2011
Many Random Walks Are Faster Than One.
Combinatorics, Probability & Computing, 2011

Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
CoRR, 2011

On The Elite of Social Networks
CoRR, 2011

Self-Adjusting Networks to Minimize Expected Path Length
CoRR, 2011

The Topology of Wireless Communication
CoRR, 2011

Order Optimal Information Spreading Using Algebraic Gossip
CoRR, 2011

Connectivity guarantees for wireless networks with directional antennas.
Comput. Geom., 2011

Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours.
Ad Hoc Networks, 2011

The topology of wireless communication.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Network Synchronization and Localization Based on Stolen Signals.
Proceedings of the Structural Information and Communication Complexity, 2011

Network synchronization and localization based on stolen signals.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Order optimal information spreading using algebraic gossip.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks.
Proceedings of the 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, 2011

Efficient distributed source coding for multiple receivers via matrix sparsification.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Distributed power control in the SINR model.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Recovering the long-range links in augmented graphs.
Theor. Comput. Sci., 2010

Structure and algorithms in the SINR wireless model.
SIGACT News, 2010

A Lower Bound for Network Navigability.
SIAM J. Discrete Math., 2010

On the connectivity threshold for general uniform metric spaces.
Inf. Process. Lett., 2010

Tight Bounds for Algebraic Gossip on Graphs
CoRR, 2010

Distributed Weighted Stable Marriage Problem.
Proceedings of the Structural Information and Communication Complexity, 2010

Tight bounds for algebraic gossip on graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Radio cover time in hyper-graphs.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

2009
Universal augmentation schemes for network navigability.
Theor. Comput. Sci., 2009

Distributed Approximate Matching.
SIAM J. Comput., 2009

Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
CoRR, 2009

A note on uniform power connectivity in the SINR model
CoRR, 2009

From Balls and Bins to Points and Vertices.
Algorithmic Operations Research, 2009

SINR diagrams: towards algorithmically usable SINR models of wireless networks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Unit disk graph and physical interference model: Putting pieces together.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources.
Proceedings of the Algorithms, 2009

A Note on Uniform Power Connectivity in the SINR Model.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst., 2008

Ski rental with two general options.
Inf. Process. Lett., 2008

The distant-2 chromatic number of random proximity and random geometric graphs.
Inf. Process. Lett., 2008

A game of timing and visibility.
Games and Economic Behavior, 2008

SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks
CoRR, 2008

Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
CoRR, 2008

Grid emulation for managing random sensor networks.
Ad Hoc Networks, 2008

Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental.
Proceedings of the STACS 2008, 2008

Improved distributed approximate matching.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Many random walks are faster than one.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Recovering the Long-Range Links in Augmented Graphs.
Proceedings of the Structural Information and Communication Complexity, 2008

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs).
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours.
Proceedings of the Distributed Computing in Sensor Systems, 2008

2007
Improved approximation algorithms for connected sensor cover.
Wireless Networks, 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Distributed approximate matching.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

On the Connectivity Threshold for General Uniform Matric Space.
Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

High Entropy Random Selection Protocols.
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

High Entropy Random Selection Protocols.
Proceedings of the Approximation, 2007

2006
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.
Inf. Process. Lett., 2006

Distributed MST for constant diameter graphs.
Distributed Computing, 2006

Tales of Huffman
CoRR, 2006

Power Assignment Problems in Wireless Communication
CoRR, 2006

About the Lifespan of Peer to Peer Networks
CoRR, 2006

Brief Announcement: On Augmented Graph Navigability.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Publish and perish: definition and analysis of an n-person publication impact game.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Efficient Distributed Weighted Matchings on Trees.
Proceedings of the Structural Information and Communication Complexity, 2006

Unbalanced Points and Vertices Problem.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

About the Lifespan of Peer to Peer Networks, .
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Managing Random Sensor Networks by means of Grid Emulation.
Proceedings of the NETWORKING 2006, 2006

A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.
Proceedings of the Algorithms, 2006

Sequences Characterizing k-Trees.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds.
SIAM J. Comput., 2005

Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices
CoRR, 2005

Timing Games and Shared Memory.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Collaborate with strangers to find own preferences.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

From Balls and Bins to Points and Vertices.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
New stability results for adversarial queuing.
SIAM J. Comput., 2004

Buffer Overflow Management in QoS Switches.
SIAM J. Comput., 2004

Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model.
SIAM J. Comput., 2004

Geometrically aware communication in random wireless networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Connectivity in evolving graph with geometric properties.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

Range-Free Ranking in Sensors Networks and Its Applications to Localization.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

Improved Approximation Algorithms for Connected Sensor Cover.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
SIAM J. Comput., 2003

Nearly optimal FIFO buffer management for two packet classes.
Computer Networks, 2003

MST construction in O(log log n) communication rounds.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Buffer overflows of merging streams.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Buffer Overflows of Merging Streams.
Proceedings of the Algorithms, 2003

2002
Average-Case Analysis of Greedy Packet Scheduling.
Theory Comput. Syst., 2002

New stability results for adversarial queuing.
SPAA, 2002

Nearly optimal FIFO buffer management for DiffServ.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Buffer overflow management in QoS switches.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Distributed MST for constant diameter graphs.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Average-case analysis of greedy packet scheduling (extended astract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
A Note on Randomized Mutual Search.
Inf. Process. Lett., 1999


  Loading...