Chen Avin - RankMe

163 papers A* 14A 14B 18C 4Misc 1Journal 91Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	D3: Enhancing reconfigurable datacenters with adaptive demand-oblivious and demand-aware integration. Comput. Networks Johannes Zerwas, Chen Griner, Stefan Schmid, Chen Avin
2026	J	`jnl`	Integrating topology and traffic engineering to maximize throughput in reconfigurable networks. Comput. Networks Chen Griner, Chen Avin
2025	J	`jnl`	Adversarial Bandit over Bandits: Hierarchical Bandits for Online Configuration Management. CoRR Chen Avin, Zvi Lotker, Shie Mannor, Gil Shabat, Hanan Shteingart, Roey Yadgar
2025	B	`conf`	Demand-Aware Small-World Networks on Clustered Demands. OPODIS Chen Avin, Robert Elsässer, Aleksander Figiel, Darya Melnyk, Stefan Schmid
2025	J	`jnl`	Revolutionizing Datacenter Networks via Reconfigurable Topologies. Commun. ACM Chen Avin, Stefan Schmid
2025	J	`jnl`	Revolutionizing Datacenter Networks via Reconfigurable Topologies. CoRR Chen Avin, Stefan Schmid
2025	—	`conf`	T3P: Topology-Tailored Tensor Parallelism. NAIC Saar Ben Yochana, Chen Avin, Gabriel Scalosub
2025	J	`jnl`	Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees. CoRR Vamsi Addanki, Chen Avin, Goran Dario Knabe, Giannis Patronas, Dimitris Syrivelis, Nikos Terzenidis, Paraskevas Bakopoulos, Ilias Marinos, Stefan Schmid
2024	J	`jnl`	Beyond matchings: Dynamic multi-hop topology for demand-aware datacenters. Comput. Networks Chen Griner, Chen Avin, Gil Einziger
2024	J	`jnl`	D3: An Adaptive Reconfigurable Datacenter Network. CoRR Johannes Zerwas, Chen Griner, Stefan Schmid, Chen Avin
2024	B	`conf`	Hash & Adjust: Competitive Demand-Aware Consistent Hashing. OPODIS Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid
2024	J	`jnl`	Hash & Adjust: Competitive Demand-Aware Consistent Hashing. CoRR Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid
2024	J	`jnl`	Integrated Topology and Traffic Engineering for Reconfigurable Datacenter Networks. CoRR Chen Griner, Chen Avin
2024	J	`jnl`	SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing. IEEE Trans. Netw. Serv. Manag. Raz Segal, Chen Avin, Gabriel Scalosub
2024	J	`jnl`	Understanding the Throughput Bounds of Reconfigurable Datacenter Networks. CoRR Vamsi Addanki, Chen Avin, Stefan Schmid
2023	A*	`conf`	Distributed Demand-aware Network Design using Bounded Square Root of Graphs. INFOCOM Or Peres, Chen Avin
2023	J	`jnl`	Distributed Self-Adjusting Tree Networks. IEEE Trans. Cloud Comput. Bruna Soares Peres, Otávio Augusto de Oliviera Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid
2023	—	`conf`	Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. SIGMETRICS (Abstracts) Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
2023	J	`jnl`	Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. Proc. ACM Meas. Anal. Comput. Syst. Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
2023	—	`conf`	Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. SIGMETRICS (Abstracts) Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub
2023	J	`jnl`	Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. Proc. ACM Meas. Anal. Comput. Syst. Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub
2023	—	`conf`	Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. SIGMETRICS (Abstracts) Vamsi Addanki, Chen Avin, Stefan Schmid
2023	J	`jnl`	Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. Proc. ACM Meas. Anal. Comput. Syst. Vamsi Addanki, Chen Avin, Stefan Schmid
2023	A*	`conf`	SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. INFOCOM Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid
2023	J	`jnl`	SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. CoRR Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid
2023	J	`jnl`	Self-adjusting grid networks. Inf. Comput. Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid
2022	J	`jnl`	CacheNet: Leveraging the principle of locality in reconfigurable network design. Comput. Networks Chen Griner, Stefan Schmid, Chen Avin
2022	—	`conf`	Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. SIGMETRICS (Abstracts) Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
2022	A*	`conf`	Constrained In-network Computing with Low Congestion in Datacenter Networks. INFOCOM Raz Segal, Chen Avin, Gabriel Scalosub
2022	J	`jnl`	Constrained In-network Computing with Low Congestion in Datacenter Networks. CoRR Raz Segal, Chen Avin, Gabriel Scalosub
2022	J	`jnl`	Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. Chen Avin, Kaushik Mondal, Stefan Schmid
2022	A	`conf`	Deterministic Self-Adjusting Tree Networks Using Rotor Walks. ICDCS Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt
2022	J	`jnl`	Deterministic Self-Adjusting Tree Networks Using Rotor Walks. CoRR Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt
2022	J	`jnl`	Hotelling games in fault-prone settings. Theor. Comput. Sci. Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
2022	J	`jnl`	Kevin: de Bruijn-based topology with demand-aware links and greedy routing. CoRR Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin
2022	J	`jnl`	Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. CoRR Vamsi Addanki, Chen Avin, Stefan Schmid
2022	J	`jnl`	Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. Chen Avin, Kaushik Mondal, Stefan Schmid
2022	J	`jnl`	Self-Adjusting Ego-Trees Topology for Reconfigurable Datacenter Networks. CoRR Chen Griner, Gil Einziger, Chen Avin
2021	B	`conf`	CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design. Networking Chen Griner, Chen Avin
2021	J	`jnl`	Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. Proc. ACM Meas. Anal. Comput. Syst. Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
2021	—	`conf`	ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware. ANCS Johannes Zerwas, Chen Avin, Stefan Schmid, Andreas Blenk
2021	—	`conf`	ReNets: Statically-Optimal Demand-Aware Networks. APOCS Chen Avin, Stefan Schmid
2021	J	`jnl`	SOAR: Minimizing Network Utilization with Bounded In-network Computing. CoRR Raz Segal, Chen Avin, Gabriel Scalosub
2021	A	`conf`	SOAR: minimizing network utilization with bounded in-network computing. CoNEXT Raz Segal, Chen Avin, Gabriel Scalosub
2020	J	`jnl`	An Online Matching Model for Self-Adjusting ToR-to-ToR Networks. CoRR Chen Avin, Chen Griner, Iosif Salem, Stefan Schmid
2020	J	`jnl`	Arithmetic Binary Search Trees: Static Optimality in the Matching Model. CoRR Chen Avin
2020	—	`conf`	De-evolution of Preferential Attachment Trees. COMPLEX NETWORKS (2) Chen Avin, Yuri Lotker
2020	J	`jnl`	Demand-aware network designs of bounded degree. Distributed Comput. Chen Avin, Kaushik Mondal, Stefan Schmid
2020	J	`jnl`	Dynamic Balanced Graph Partitioning. SIAM J. Discret. Math. Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid
2020	B	`conf`	Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN Chen Avin, Kaushik Mondal, Stefan Schmid
2020	—	`conf`	On the Complexity of Traffic Traces and Implications. SIGMETRICS (Abstracts) Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
2020	J	`jnl`	On the Complexity of Traffic Traces and Implications. Proc. ACM Meas. Anal. Comput. Syst. Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
2020	J	`jnl`	Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs. CoRR Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
2020	A*	`conf`	Working Set Theorems for Routing in Self-Adjusting Skip List Networks. INFOCOM Chen Avin, Iosif Salem, Stefan Schmid
2019	A	`conf`	Brief Announcement: On Self-Adjusting Skip List Networks. DISC Chen Avin, Iosif Salem, Stefan Schmid
2019	J	`jnl`	Competitive clustering of stochastic communication patterns on a ring. Computing Chen Avin, Louis Cohen, Mahmoud Parham, Stefan Schmid
2019	A*	`conf`	Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM Chen Avin, Kaushik Mondal, Stefan Schmid
2019	A*	`conf`	Distributed Self-Adjusting Tree Networks. INFOCOM Bruna Soares Peres, Otávio Augusto de Oliviera Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid
2019	Misc	`conf`	Majority vote and monopolies in social networks. ICDCN Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg
2019	J	`jnl`	Measuring the Complexity of Packet Traces. CoRR Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
2019	B	`conf`	Nap: Network-Aware Data Partitions for Efficient Distributed Processing. NCA Or Raz, Chen Avin, Stefan Schmid
2019	B	`conf`	Random preferential attachment hypergraph. ASONAM Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2019	J	`jnl`	ReNets: Toward Statically Optimal Self-Adjusting Networks. CoRR Chen Avin, Stefan Schmid
2019	J	`jnl`	Self-Adjusting Linear Networks. CoRR Chen Avin, Ingo van Duijn, Stefan Schmid
2019	B	`conf`	Self-adjusting Linear Networks. SIROCCO Chen Avin, Ingo van Duijn, Stefan Schmid
2019	C	`conf`	Self-adjusting Linear Networks. SSS Chen Avin, Ingo van Duijn, Stefan Schmid
2018	J	`jnl`	Breaking the $$\log n$$ log n barrier on rumor spreading. Distributed Comput. Chen Avin, Robert Elsässer
2018	J	`jnl`	Cover time and mixing time of random walks on dynamic graphs. Random Struct. Algorithms Chen Avin, Michal Koucký, Zvi Lotker
2018	J	`jnl`	Fault-Tolerant Hotelling Games. CoRR Chen Avin, Avi Cohen, Zvi Lotker, David Peleg
2018	B	`conf`	Homophily and Nationality Assortativity Among the Most Cited Researchers' Social Network. ASONAM Michal Vaanunu, Chen Avin
2018	A*	`conf`	Preferential Attachment as a Unique Equilibrium. WWW Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg
2018	J	`jnl`	Push-Down Trees: Optimal Self-Adjusting Complete Trees. CoRR Chen Avin, Kaushik Mondal, Stefan Schmid
2018	J	`jnl`	Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks. CoRR Chen Avin, Stefan Schmid
2018	J	`jnl`	Toward demand-aware networking: a theory for self-adjusting networks. Comput. Commun. Rev. Chen Avin, Stefan Schmid
2017	—	`conf`	Assortative Mixing Equilibria in Social Network Games. GAMENETS Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
2017	J	`jnl`	Assortative Mixing Equilibria in Social Network Games. CoRR Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg
2017	A	`conf`	Brief Announcement: Distributed SplayNets. DISC Bruna Soares Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin
2017	—	`conf`	Competitive Clustering of Stochastic Communication Patterns on a Ring. NETYS Chen Avin, Louis Cohen, Stefan Schmid
2017	A	`conf`	Demand-Aware Network Designs of Bounded Degree. DISC Chen Avin, Kaushik Mondal, Stefan Schmid
2017	J	`jnl`	Demand-Aware Network Designs of Bounded Degree. CoRR Chen Avin, Kaushik Mondal, Stefan Schmid
2017	J	`jnl`	Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2017	A*	`conf`	Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. KDD Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2017	J	`jnl`	On the power of uniform power: capacity of wireless networks with bounded resources. Wirel. Networks Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
2017	J	`jnl`	SINR diagram with interference cancellation. Ad Hoc Networks Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2017	J	`jnl`	Towards Communication-Aware Robust Topologies. CoRR Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid
2016	A	`conf`	Information Spreading in Dynamic Networks Under Oblivious Adversaries. DISC John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman
2016	J	`jnl`	Information Spreading in Dynamic Networks under Oblivious Adversaries. CoRR John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman
2016	J	`jnl`	On social networks of program committees - Structure and effect on paper acceptance fairness. Soc. Netw. Anal. Min. Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
2016	A	`conf`	Online Balanced Repartitioning. DISC Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
2016	J	`jnl`	SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw. Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
2015	J	`jnl`	Breaking the log n barrier on rumor spreading. CoRR Chen Avin, Robert Elsässer
2015	—	`conf`	Core Size and Densification in Preferential Attachment Networks. ICALP (2) Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg
2015	A	`conf`	Homophily and the Glass Ceiling Effect in Social Networks. ITCS Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet
2015	J	`jnl`	Network Coding Based Information Spreading in Dynamic Networks With Correlated Data. IEEE J. Sel. Areas Commun. Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel Médard
2015	J	`jnl`	Online Balanced Repartitioning. CoRR Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
2015	J	`jnl`	Random Preferential Attachment Hypergraphs. CoRR Chen Avin, Zvi Lotker, David Peleg
2015	J	`jnl`	Self-adjusting grid networks to minimize expected path length. Theor. Comput. Sci. Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
2015	B	`conf`	Social Network Analysis of Program Committees and Paper Acceptance Fairness. ASONAM Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel
2014	J	`jnl`	Bounds for algebraic gossip on graphs. Random Struct. Algorithms Michael Borokhovich, Chen Avin, Zvi Lotker
2014	J	`jnl`	Core-Periphery in Networks: An Axiomatic Approach. CoRR Chen Avin, Zvi Lotker, David Peleg, Yvonne-Anne Pignolet, Itzik Turkel
2014	—	`conf`	Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2014	J	`jnl`	Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg
2014	J	`jnl`	Radio cover time in hyper-graphs. Ad Hoc Networks Chen Avin, Yuval Lando, Zvi Lotker
2014	J	`jnl`	Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	J	`jnl`	Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks. Ad Hoc Networks Efi Dror, Chen Avin, Zvi Lotker
2013	A	`conf`	Faster Rumor Spreading: Breaking the logn Barrier. DISC Chen Avin, Robert Elsässer
2013	A*	`conf`	Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	J	`jnl`	Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	A	`conf`	Locally Self-Adjusting Tree Networks. IPDPS Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid
2013	J	`jnl`	OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs. CoRR Chen Avin, Michael Borokhovich, Stefan Schmid
2013	—	`conf`	OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs. P2P Chen Avin, Michael Borokhovich, Stefan Schmid
2013	J	`jnl`	Order optimal information spreading using algebraic gossip. Distributed Comput. Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker
2013	J	`jnl`	SINR Diagram with Interference Cancellation. CoRR Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2013	B	`conf`	Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
2013	J	`jnl`	Simple Destination-Swap Strategies for Adaptive Intra- and Inter-Tenant VM Migration. CoRR Chen Avin, Omer Dunay, Stefan Schmid
2012	J	`jnl`	A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model. Theor. Comput. Sci. Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet
2012	A	`conf`	Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. DISC Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker
2012	J	`jnl`	Network Coded Gossip with Correlated Data CoRR Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard
2012	B	`conf`	Network coded gossip with correlated data. ISIT Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard
2012	—	`conf`	Optimal virtual traffic light placement. FOMC Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker
2012	J	`jnl`	SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2012	A*	`conf`	SINR diagram with interference cancellation. SODA Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
2012	J	`jnl`	Scalable, hierarchical, Ethernet transport network architecture (HETNA). Telecommun. Syst. Eliav Menachi, Chen Avin, Ran Giladi
2011	J	`jnl`	Efficient Joint Network-Source Coding for Multiple Terminals with Side Information CoRR Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker
2011	B	`conf`	Efficient distributed source coding for multiple receivers via matrix sparsification. ISIT Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker
2011	—	`conf`	Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks. Med-Hoc-Net Efi Dror, Chen Avin, Zvi Lotker
2011	C	`conf`	Geographical quadtree routing. ISCC Chen Avin, Yaniv Dvory, Ran Giladi
2011	J	`jnl`	Many Random Walks Are Faster Than One. Comb. Probab. Comput. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2011	J	`jnl`	On The Elite of Social Networks CoRR Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
2011	J	`jnl`	Order Optimal Information Spreading Using Algebraic Gossip CoRR Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker
2011	A*	`conf`	Order optimal information spreading using algebraic gossip. PODC Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker
2011	C	`conf`	PSP: Path state protocol for inter-domain routing. ISCC Chen Avin, Ran Giladi, Dotan Guy
2011	J	`jnl`	Self-Adjusting Networks to Minimize Expected Path Length CoRR Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker
2010	J	`jnl`	Probabilistic quorum systems in wireless Ad Hoc networks. ACM Trans. Comput. Syst. Roy Friedman, Gabriel Kliot, Chen Avin
2010	B	`conf`	Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN Marco Zuniga, Chen Avin, Manfred Hauswirth
2010	—	`conf`	Radio cover time in hyper-graphs. DIALM-PODC Chen Avin, Yuval Lando, Zvi Lotker
2010	J	`jnl`	Tight Bounds for Algebraic Gossip on Graphs CoRR Michael Borokhovich, Chen Avin, Zvi Lotker
2010	B	`conf`	Tight bounds for algebraic gossip on graphs. ISIT Michael Borokhovich, Chen Avin, Zvi Lotker
2009	C	`conf`	A Note on Uniform Power Connectivity in the SINR Model. ALGOSENSORS Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet
2009	J	`jnl`	A note on uniform power connectivity in the SINR model CoRR Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet
2009	B	`conf`	From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. GLOBECOM Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker
2009	—	`conf`	Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. CSEDU (2) Chen Avin, Michael Borokhovich, Arik Goldfeld
2009	A	`conf`	On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. ESA Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
2009	A*	`conf`	SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2009	J	`jnl`	Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs) CoRR Chen Avin, Yuval Lando, Zvi Lotker
2009	J	`jnl`	Using Heterogeneity to Enhance Random Walk-based Queries. J. Signal Process. Syst. Marco Zuniga, Chen Avin, Bhaskar Krishnamachari
2008	—	`conf`	Distance graphs: from random geometric graphs to Bernoulli graphs and between. DIALM-POMC Chen Avin
2008	J	`jnl`	Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. Comput. Commun. Rev. Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, Bhaskar Krishnamachari
2008	J	`jnl`	Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. Internet Math. Chen Avin
2008	—	`conf`	How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) Chen Avin, Michal Koucký, Zvi Lotker
2008	B	`conf`	Many random walks are faster than one. SPAA Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2008	A	`conf`	Probabilistic quorum systems in wireless ad hoc networks. DSN Roy Friedman, Gabriel Kliot, Chen Avin
2008	J	`jnl`	SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks CoRR Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
2008	J	`jnl`	The power of choice in random walks: An empirical study. Comput. Networks Chen Avin, Bhaskar Krishnamachari
2007	J	`jnl`	An upper bound on computing all X-minimal models. AI Commun. Chen Avin, Rachel Ben-Eliyahu-Zohary
2007	J	`jnl`	Evolutionary Reputation Games On Social Networks. Complex Syst. Chen Avin, David Dayan-Rosenman
2007	J	`jnl`	On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci. Chen Avin, Gunes Ercal
2006	A	`conf`	The power of choice in random walks: an empirical study. MSWiM Chen Avin, Bhaskar Krishnamachari
2005	B	`conf`	Bounds on the mixing time and partial cover of ad-hoc and sensor networks. EWSN Chen Avin, Gunes Ercal
2005	A*	`conf`	Identifiability of Path-Specific Effects. IJCAI Chen Avin, Ilya Shpitser, Judea Pearl
2005	A*	`conf`	On the Cover Time of Random Geometric Graphs. ICALP Chen Avin, Gunes Ercal
2004	—	`conf`	Efficient and robust query processing in dynamic environments using random walk techniques. IPSN Chen Avin, Carlos Brito
2001	B	`conf`	Algorithms for Computing X-Minimal Models. LPNMR Chen Avin, Rachel Ben-Eliyahu-Zohary