Chen Avin
Chen Avin
School of Electrical and Computer Engineering. Ben Gurion University of the Negev
Verified email at - Homepage
Cited by
Cited by
Identifiability of path-specific effects
C Avin, I Shpitser, J Pearl
How to explore a fast-changing world (cover time of a simple random walk on evolving graphs)
C Avin, M Koucký, Z Lotker
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
Many random walks are faster than one
N Alon, C Avin, M Koucky, G Kozma, Z Lotker, MR Tuttle
Proceedings of the twentieth annual symposium on parallelism in algorithms …, 2008
Efficient and robust query processing in dynamic environments using random walk techniques
C Avin, C Brito
Proceedings of the 3rd international symposium on Information processing in …, 2004
The power of choice in random walks: An empirical study
C Avin, B Krishnamachari
Proceedings of the 9th ACM international symposium on Modeling analysis and …, 2006
On the cover time and mixing time of random geometric graphs
C Avin, G Ercal
Theoretical Computer Science 380 (1-2), 2-22, 2007
Homophily and the glass ceiling effect in social networks
C Avin, B Keller, Z Lotker, C Mathieu, D Peleg, YA Pignolet
Proceedings of the 2015 conference on innovations in theoretical computer …, 2015
Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks
E Dror, C Avin, Z Lotker
2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, 1-8, 2011
On the complexity of traffic traces and implications
C Avin, M Ghobadi, C Griner, S Schmid
Proceedings of the ACM on Measurement and Analysis of Computing Systems 4 (1 …, 2020
On the cover time of random geometric graphs
C Avin, G Ercal
International Colloquium on Automata, Languages, and Programming, 677-689, 2005
Toward demand-aware networking: A theory for self-adjusting networks
C Avin, S Schmid
ACM SIGCOMM Computer Communication Review 48 (5), 31-40, 2019
Splaynet: Towards locally self-adjusting networks
S Schmid, C Avin, C Scheideler, M Borokhovich, B Haeupler, Z Lotker
IEEE/ACM Transactions on Networking 24 (3), 1421-1433, 2015
SINR diagrams: Towards algorithmically usable SINR models of wireless networks
C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
Demand-aware network designs of bounded degree
C Avin, K Mondal, S Schmid
Distributed Computing 33 (3), 311-325, 2020
Tight bounds for algebraic gossip on graphs
M Borokhovich, C Avin, Z Lotker
2010 IEEE International Symposium on Information Theory, 1758-1762, 2010
Cerberus: The power of choices in datacenter topology design-a throughput perspective
C Griner, J Zerwas, A Blenk, M Ghobadi, S Schmid, C Avin
Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (3 …, 2021
SINR diagrams: Convexity and its applications in wireless networks
C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty
Journal of the ACM (JACM) 59 (4), 1-34, 2012
A note on uniform power connectivity in the SINR model
C Avin, Z Lotker, F Pasquale, YA Pignolet
International Symposium on Algorithms and Experiments for Sensor Systems …, 2009
Probabilistic quorum systems in wireless ad hoc networks
R Friedman, G Kliot, C Avin
ACM Transactions on Computer Systems (TOCS) 28 (3), 1-50, 2008
Demand-aware network design with minimal congestion and route lengths
C Avin, K Mondal, S Schmid
IEEE/ACM Transactions on Networking 30 (4), 1838-1848, 2022
The system can't perform the operation now. Try again later.
Articles 1–20