default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChen Avin
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[d1]Arash Pourdamghani
, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid:
Hash-And-Adjust. DROPS Artifacts, 2025
- 2024
- [j44]Chen Griner, Chen Avin, Gil Einziger:
Beyond matchings: Dynamic multi-hop topology for demand-aware datacenters. Comput. Networks 240: 110143 (2024) - [j43]Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing. IEEE Trans. Netw. Serv. Manag. 21(2): 1832-1851 (2024) - [c70]Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid:
Hash & Adjust: Competitive Demand-Aware Consistent Hashing. OPODIS 2024: 24:1-24:23 - [i42]Chen Griner, Chen Avin:
Integrated Topology and Traffic Engineering for Reconfigurable Datacenter Networks. CoRR abs/2402.09115 (2024) - [i41]Vamsi Addanki, Chen Avin, Stefan Schmid:
Understanding the Throughput Bounds of Reconfigurable Datacenter Networks. CoRR abs/2405.20869 (2024) - [i40]Johannes Zerwas, Chen Griner, Stefan Schmid, Chen Avin:
D3: An Adaptive Reconfigurable Datacenter Network. CoRR abs/2406.13380 (2024) - [i39]Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid:
Hash & Adjust: Competitive Demand-Aware Consistent Hashing. CoRR abs/2411.11665 (2024) - 2023
- [j42]Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid:
Self-adjusting grid networks. Inf. Comput. 292: 105038 (2023) - [j41]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 2:1-2:43 (2023) - [j40]Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub:
Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 10:1-10:33 (2023) - [j39]Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin:
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 20:1-20:25 (2023) - [j38]Bruna Soares Peres, Otávio Augusto de Oliviera Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid:
Distributed Self-Adjusting Tree Networks. IEEE Trans. Cloud Comput. 11(1): 716-729 (2023) - [c69]Or Peres, Chen Avin:
Distributed Demand-aware Network Design using Bounded Square Root of Graphs. INFOCOM 2023: 1-10 - [c68]Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid:
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. INFOCOM 2023: 1-10 - [c67]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. SIGMETRICS (Abstracts) 2023: 3-4 - [c66]Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin:
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control. SIGMETRICS (Abstracts) 2023: 7-8 - [c65]Itamar Gozlan, Chen Avin, Gil Einziger, Gabriel Scalosub:
Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing. SIGMETRICS (Abstracts) 2023: 15-16 - [i38]Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid:
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. CoRR abs/2301.03074 (2023) - 2022
- [j37]Chen Griner, Stefan Schmid, Chen Avin:
CacheNet: Leveraging the principle of locality in reconfigurable network design. Comput. Networks 204: 108648 (2022) - [j36]Chen Avin, Avi Cohen, Zvi Lotker, David Peleg:
Hotelling games in fault-prone settings. Theor. Comput. Sci. 922: 96-107 (2022) - [j35]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. 30(4): 1838-1848 (2022) - [j34]Chen Avin, Kaushik Mondal, Stefan Schmid:
Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. 30(6): 2419-2432 (2022) - [c64]Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt:
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. ICDCS 2022: 67-77 - [c63]Raz Segal, Chen Avin, Gabriel Scalosub:
Constrained In-network Computing with Low Congestion in Datacenter Networks. INFOCOM 2022: 1639-1648 - [c62]Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin:
Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. SIGMETRICS (Abstracts) 2022: 99-100 - [i37]Raz Segal, Chen Avin, Gabriel Scalosub:
Constrained In-network Computing with Low Congestion in Datacenter Networks. CoRR abs/2201.04344 (2022) - [i36]Chen Griner, Gil Einziger, Chen Avin:
Self-Adjusting Ego-Trees Topology for Reconfigurable Datacenter Networks. CoRR abs/2202.00320 (2022) - [i35]Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin:
Kevin: de Bruijn-based topology with demand-aware links and greedy routing. CoRR abs/2202.05487 (2022) - [i34]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. CoRR abs/2204.02525 (2022) - [i33]Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt:
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. CoRR abs/2204.10754 (2022) - 2021
- [j33]Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin:
Cerberus: The Power of Choices in Datacenter Topology Design - A Throughput Perspective. Proc. ACM Meas. Anal. Comput. Syst. 5(3): 38:1-38:33 (2021) - [c61]Johannes Zerwas, Chen Avin, Stefan Schmid, Andreas Blenk:
ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware. ANCS 2021: 66-72 - [c60]Chen Avin, Stefan Schmid:
ReNets: Statically-Optimal Demand-Aware Networks. APOCS 2021: 25-39 - [c59]Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: minimizing network utilization with bounded in-network computing. CoNEXT 2021: 16-29 - [c58]Chen Griner, Chen Avin:
CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design. Networking 2021: 1-3 - [i32]Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: Minimizing Network Utilization with Bounded In-network Computing. CoRR abs/2110.14224 (2021) - 2020
- [j32]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-aware network designs of bounded degree. Distributed Comput. 33(3-4): 311-325 (2020) - [j31]Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid:
On the Complexity of Traffic Traces and Implications. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 20:1-20:29 (2020) - [j30]Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Dynamic Balanced Graph Partitioning. SIAM J. Discret. Math. 34(3): 1791-1812 (2020) - [c57]Chen Avin, Yuri Lotker:
De-evolution of Preferential Attachment Trees. COMPLEX NETWORKS (2) 2020: 508-519 - [c56]Chen Avin, Iosif Salem, Stefan Schmid:
Working Set Theorems for Routing in Self-Adjusting Skip List Networks. INFOCOM 2020: 2175-2184 - [c55]Chen Avin, Kaushik Mondal, Stefan Schmid:
Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN 2020: 143-154 - [c54]Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid:
On the Complexity of Traffic Traces and Implications. SIGMETRICS (Abstracts) 2020: 47-48 - [i31]Chen Avin, Chen Griner, Iosif Salem, Stefan Schmid:
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks. CoRR abs/2006.11148 (2020) - [i30]Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin:
Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs. CoRR abs/2010.13081 (2020) - [i29]Chen Avin:
Arithmetic Binary Search Trees: Static Optimality in the Matching Model. CoRR abs/2012.13698 (2020)
2010 – 2019
- 2019
- [j29]Chen Avin, Louis Cohen, Mahmoud Parham, Stefan Schmid:
Competitive clustering of stochastic communication patterns on a ring. Computing 101(9): 1369-1390 (2019) - [c53]Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Random preferential attachment hypergraph. ASONAM 2019: 398-405 - [c52]Chen Avin, Zvi Lotker, Assaf Mizrachi, David Peleg:
Majority vote and monopolies in social networks. ICDCN 2019: 342-351 - [c51]Bruna Soares Peres, Otávio Augusto de Oliviera Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid:
Distributed Self-Adjusting Tree Networks. INFOCOM 2019: 145-153 - [c50]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM 2019: 1351-1359 - [c49]Or Raz, Chen Avin, Stefan Schmid:
Nap: Network-Aware Data Partitions for Efficient Distributed Processing. NCA 2019: 1-9 - [c48]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-adjusting Linear Networks. SIROCCO 2019: 332-335 - [c47]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-adjusting Linear Networks. SSS 2019: 368-382 - [c46]Chen Avin, Iosif Salem, Stefan Schmid:
Brief Announcement: On Self-Adjusting Skip List Networks. DISC 2019: 35:1-35:3 - [i28]Chen Avin, Stefan Schmid:
ReNets: Toward Statically Optimal Self-Adjusting Networks. CoRR abs/1904.03263 (2019) - [i27]Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-Adjusting Linear Networks. CoRR abs/1905.02472 (2019) - [i26]Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid:
Measuring the Complexity of Packet Traces. CoRR abs/1905.08339 (2019) - 2018
- [j28]Chen Avin, Stefan Schmid:
Toward demand-aware networking: a theory for self-adjusting networks. Comput. Commun. Rev. 48(5): 31-40 (2018) - [j27]Chen Avin, Robert Elsässer:
Breaking the $$\log n$$ log n barrier on rumor spreading. Distributed Comput. 31(6): 503-513 (2018) - [j26]Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid:
rDAN: Toward robust demand-aware network designs. Inf. Process. Lett. 133: 5-9 (2018) - [j25]Chen Avin, Michal Koucký, Zvi Lotker:
Cover time and mixing time of random walks on dynamic graphs. Random Struct. Algorithms 52(4): 576-596 (2018) - [c45]Michal Vaanunu, Chen Avin:
Homophily and Nationality Assortativity Among the Most Cited Researchers' Social Network. ASONAM 2018: 584-586 - [c44]Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg:
Preferential Attachment as a Unique Equilibrium. WWW 2018: 559-568 - [i25]Chen Avin, Avi Cohen, Zvi Lotker, David Peleg:
Fault-Tolerant Hotelling Games. CoRR abs/1801.04669 (2018) - [i24]Chen Avin, Stefan Schmid:
Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks. CoRR abs/1807.02935 (2018) - [i23]Chen Avin, Kaushik Mondal, Stefan Schmid:
Push-Down Trees: Optimal Self-Adjusting Complete Trees. CoRR abs/1807.04613 (2018) - 2017
- [j24]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR diagram with interference cancellation. Ad Hoc Networks 54: 1-16 (2017) - [j23]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. 99: 51-67 (2017) - [j22]Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet:
On the power of uniform power: capacity of wireless networks with bounded resources. Wirel. Networks 23(8): 2319-2333 (2017) - [c43]Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg:
Assortative Mixing Equilibria in Social Network Games. GAMENETS 2017: 29-39 - [c42]Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks. KDD 2017: 45-53 - [c41]Chen Avin, Louis Cohen, Stefan Schmid:
Competitive Clustering of Stochastic Communication Patterns on a Ring. NETYS 2017: 231-247 - [c40]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. DISC 2017: 5:1-5:16 - [c39]Bruna Soares Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin:
Brief Announcement: Distributed SplayNets. DISC 2017: 58:1-58:3 - [i22]Chen Avin, Hadassa Daltrophe, Zvi Lotker, David Peleg:
Assortative Mixing Equilibria in Social Network Games. CoRR abs/1703.08776 (2017) - [i21]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. CoRR abs/1705.06024 (2017) - [i20]Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid:
Towards Communication-Aware Robust Topologies. CoRR abs/1705.07163 (2017) - 2016
- [j21]Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel:
On social networks of program committees - Structure and effect on paper acceptance fairness. Soc. Netw. Anal. Min. 6(1): 18:1-18:20 (2016) - [j20]Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw. 24(3): 1421-1433 (2016) - [c38]Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Online Balanced Repartitioning. DISC 2016: 243-256 - [c37]John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks Under Oblivious Adversaries. DISC 2016: 399-413 - [i19]John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks under Oblivious Adversaries. CoRR abs/1607.05645 (2016) - 2015
- [j19]Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel Médard:
Network Coding Based Information Spreading in Dynamic Networks With Correlated Data. IEEE J. Sel. Areas Commun. 33(2): 213-224 (2015) - [j18]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting grid networks to minimize expected path length. Theor. Comput. Sci. 584: 91-102 (2015) - [c36]Chen Avin, Zvi Lotker, David Peleg, Itzik Turkel:
Social Network Analysis of Program Committees and Paper Acceptance Fairness. ASONAM 2015: 488-495 - [c35]Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Core Size and Densification in Preferential Attachment Networks. ICALP (2) 2015: 492-503 - [c34]Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet:
Homophily and the Glass Ceiling Effect in Social Networks. ITCS 2015: 41-50 - [i18]Chen Avin, Zvi Lotker, David Peleg:
Random Preferential Attachment Hypergraphs. CoRR abs/1502.02401 (2015) - [i17]Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Online Balanced Repartitioning. CoRR abs/1511.02074 (2015) - [i16]Chen Avin, Robert Elsässer:
Breaking the log n barrier on rumor spreading. CoRR abs/1512.03022 (2015) - 2014
- [j17]Chen Avin, Yuval Lando, Zvi Lotker:
Radio cover time in hyper-graphs. Ad Hoc Networks 12: 278-290 (2014) - [j16]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114(12): 728-733 (2014) - [j15]Michael Borokhovich, Chen Avin, Zvi Lotker:
Bounds for algebraic gossip on graphs. Random Struct. Algorithms 45(2): 185-217 (2014) - [c33]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) 2014: 399-410 - [i15]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR abs/1404.6561 (2014) - [i14]Chen Avin, Zvi Lotker, David Peleg, Yvonne-Anne Pignolet, Itzik Turkel:
Core-Periphery in Networks: An Axiomatic Approach. CoRR abs/1411.2242 (2014) - 2013
- [j14]Efi Dror, Chen Avin, Zvi Lotker:
Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks. Ad Hoc Networks 11(7): 2002-2015 (2013) - [j13]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. Distributed Comput. 26(2): 99-117 (2013) - [c32]Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid:
Locally Self-Adjusting Tree Networks. IPDPS 2013: 395-406 - [c31]Chen Avin, Michael Borokhovich, Stefan Schmid:
OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs. P2P 2013: 1-5 - [c30]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO 2013: 36-54 - [c29]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA 2013: 478-497 - [c28]Chen Avin, Robert Elsässer:
Faster Rumor Spreading: Breaking the logn Barrier. DISC 2013: 209-223 - [i13]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR abs/1308.5915 (2013) - [i12]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR Diagram with Interference Cancellation. CoRR abs/1309.3193 (2013) - [i11]Chen Avin, Michael Borokhovich, Stefan Schmid:
OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs. CoRR abs/1309.3319 (2013) - [i10]Chen Avin, Omer Dunay, Stefan Schmid:
Simple Destination-Swap Strategies for Adaptive Intra- and Inter-Tenant VM Migration. CoRR abs/1309.5826 (2013) - 2012
- [j12]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59(4): 18:1-18:34 (2012) - [j11]Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet:
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model. Theor. Comput. Sci. 453: 2-13 (2012) - [j10]Eliav Menachi, Chen Avin, Ran Giladi:
Scalable, hierarchical, Ethernet transport network architecture (HETNA). Telecommun. Syst. 49(3): 299-312 (2012) - [c27]Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker:
Optimal virtual traffic light placement. FOMC 2012: 6 - [c26]Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard:
Network coded gossip with correlated data. ISIT 2012: 2616-2620 - [c25]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR diagram with interference cancellation. SODA 2012: 502-515 - [c24]Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker:
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. DISC 2012: 439-440 - [i9]Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard:
Network Coded Gossip with Correlated Data. CoRR abs/1202.1801 (2012) - 2011
- [j9]Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many Random Walks Are Faster Than One. Comb. Probab. Comput. 20(4): 481-502 (2011) - [c23]Chen Avin, Ran Giladi, Dotan Guy:
PSP: Path state protocol for inter-domain routing. ISCC 2011: 287-293 - [c22]Chen Avin, Yaniv Dvory, Ran Giladi:
Geographical quadtree routing. ISCC 2011: 302-308 - [c21]Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker:
Efficient distributed source coding for multiple receivers via matrix sparsification. ISIT 2011: 2045-2049 - [c20]Efi Dror, Chen Avin, Zvi Lotker:
Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks. Med-Hoc-Net 2011: 1-8 - [c19]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. PODC 2011: 363-372 - [i8]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order Optimal Information Spreading Using Algebraic Gossip. CoRR abs/1101.4372 (2011) - [i7]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-Adjusting Networks to Minimize Expected Path Length. CoRR abs/1110.0196 (2011) - [i6]Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet:
On The Elite of Social Networks. CoRR abs/1111.3374 (2011) - [i5]Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker:
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information. CoRR abs/1111.5735 (2011) - 2010
- [j8]Roy Friedman, Gabriel Kliot, Chen Avin:
Probabilistic quorum systems in wireless Ad Hoc networks. ACM Trans. Comput. Syst. 28(3): 7:1-7:50 (2010) - [c18]Chen Avin, Yuval Lando, Zvi Lotker:
Radio cover time in hyper-graphs. DIALM-PODC 2010: 3-12 - [c17]Marco Zuniga, Chen Avin, Manfred Hauswirth:
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. EWSN 2010: 49-64 - [c16]Michael Borokhovich, Chen Avin, Zvi Lotker:
Tight bounds for algebraic gossip on graphs. ISIT 2010: 1758-1762 - [i4]Michael Borokhovich, Chen Avin, Zvi Lotker:
Tight Bounds for Algebraic Gossip on Graphs. CoRR abs/1001.3265 (2010)
2000 – 2009
- 2009
- [j7]Marco Zuniga, Chen Avin, Bhaskar Krishnamachari:
Using Heterogeneity to Enhance Random Walk-based Queries. J. Signal Process. Syst. 57(3): 401-414 (2009) - [c15]Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet:
A Note on Uniform Power Connectivity in the SINR Model. ALGOSENSORS 2009: 116-127 - [c14]Chen Avin, Michael Borokhovich, Arik Goldfeld:
Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. CSEDU (2) 2009: 250-257 - [c13]Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet:
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. ESA 2009: 373-384 - [c12]Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker:
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. GLOBECOM 2009: 1-6 - [c11]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209 - [i3]Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne-Anne Pignolet:
A note on uniform power connectivity in the SINR model. CoRR abs/0906.2311 (2009) - [i2]Chen Avin, Yuval Lando, Zvi Lotker:
Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs). CoRR abs/0907.1678 (2009) - 2008
- [j6]Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash Sridharan, Marco Zuniga, Jung-Hyun Jun, Chen Avin, Bhaskar Krishnamachari:
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. Comput. Commun. Rev. 38(3): 17-26 (2008) - [j5]Chen Avin, Bhaskar Krishnamachari:
The power of choice in random walks: An empirical study. Comput. Networks 52(1): 44-60 (2008) - [j4]Chen Avin:
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. Internet Math. 5(3): 195-210 (2008) - [c10]Chen Avin:
Distance graphs: from random geometric graphs to Bernoulli graphs and between. DIALM-POMC 2008: 71-78 - [c9]Roy Friedman, Gabriel Kliot, Chen Avin:
Probabilistic quorum systems in wireless ad hoc networks. DSN 2008: 277-286 - [c8]Chen Avin, Michal Koucký, Zvi Lotker:
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) 2008: 121-132 - [c7]Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many random walks are faster than one. SPAA 2008: 119-128 - [i1]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. CoRR abs/0811.3284 (2008) - 2007
- [j3]Chen Avin, Rachel Ben-Eliyahu-Zohary:
An upper bound on computing all X-minimal models. AI Commun. 20(2): 87-92 (2007) - [j2]Chen Avin, David Dayan-Rosenman:
Evolutionary Reputation Games On Social Networks. Complex Syst. 17(3) (2007) - [j1]Chen Avin, Gunes Ercal:
On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci. 380(1-2): 2-22 (2007) - 2006
- [c6]Chen Avin, Bhaskar Krishnamachari:
The power of choice in random walks: an empirical study. MSWiM 2006: 219-228 - 2005
- [c5]Chen Avin, Gunes Ercal:
Bounds on the mixing time and partial cover of ad-hoc and sensor networks. EWSN 2005: 1-12 - [c4]Chen Avin, Gunes Ercal:
On the Cover Time of Random Geometric Graphs. ICALP 2005: 677-689 - [c3]Chen Avin, Ilya Shpitser, Judea Pearl:
Identifiability of Path-Specific Effects. IJCAI 2005: 357-363 - 2004
- [c2]Chen Avin, Carlos Brito:
Efficient and robust query processing in dynamic environments using random walk techniques. IPSN 2004: 277-286 - 2001
- [c1]Chen Avin, Rachel Ben-Eliyahu-Zohary:
Algorithms for Computing X-Minimal Models. LPNMR 2001: 322-335
Coauthor Index
[j36] [c53] [c52] [j25] [c44] [i25] [j24] [j23] [j22] [c43] [c42] [i22] [j21] [j20] [j18] [c36] [c35] [c34] [i18] [j17] [j16] [j15] [c33] [i15] [i14] [j14] [j13] [c32] [c30] [c29] [i13] [i12] [j12] [j11] [c27] [c25] [c24] [j9] [c21] [c20] [c19] [i8] [i7] [i6] [i5] [c18] [c16] [i4] [c15] [c13] [c12] [c11] [i3] [i2] [c8] [c7] [i1]
[d1] [c70] [i41] [i40] [i39] [j42] [j41] [j39] [j38] [c68] [c67] [c66] [i38] [j37] [j35] [j34] [c64] [c62] [i35] [i34] [i33] [j33] [c61] [c60] [j32] [j31] [j30] [c56] [c55] [c54] [i31] [i30] [j29] [c51] [c50] [c49] [c48] [c47] [c46] [i28] [i27] [i26] [j28] [j26] [i24] [i23] [c41] [c40] [c39] [i21] [i20] [j20] [c38] [i17] [c32] [c31] [i11] [i10] [c24]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
