Mira Gonen

CoRR, January, 2025

2024

Minimizing the Alphabet Size in Codes With Restricted Error Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2024

2022

Group Testing on General Set-Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Minimizing the Alphabet Size in Codes with Restricted Error Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Minimizing the alphabet size of erasure codes with restricted decoding sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Probabilistic Physical Search on General Graphs: Approximations and Heuristics.

[BibT_eX]

[DOI]

Noam Hazon

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Edit Distance with Multiple Block Operations†.

[BibT_eX]

[DOI]

Dana Shapira

James A. Storer

Comput. J., 2019

On interval and circular-arc covering problems.

[BibT_eX]

[DOI]

Reuven Cohen

Ann. Oper. Res., 2019

2018

Latency and Alphabet Size in the Context of Multicast Network Coding.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

On nonlinear multi-covering problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2015

Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs.

[BibT_eX]

[DOI]

Noam Hazon

Max Kleb

CoRR, 2015

2012

Coded cooperative data exchange problem for general topologies.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

An optimal topology for a static P2P live streaming network: Analysis and real-world results.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Peer-to-Peer Computing, 2011

An Optimal Topology for a Static P2P Live Streaming Network with Limited Resources.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

2010

Counting Stars and Other Small Subgraphs in Sublinear Time.

[BibT_eX]

[DOI]

Dana Ron

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A Theta(logn.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Approximating the Number of Network Motifs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

2008

Bounding the bias of tree-like sampling in IP topologies.

[BibT_eX]

[DOI]

Reuven Cohen

Avishai Wool

Networks Heterog. Media, 2008

An O(log n)-approximation for the Set Cover Problem with Set Ownership

[BibT_eX]

[DOI]

CoRR, 2008

2007

Characterizing Truthful Market Design.

[BibT_eX]

[DOI]

Rica Gonen

Elan Pavlov

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Finding a Dense-Core in Jellyfish Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Generalized trade reduction mechanisms.

[BibT_eX]

[DOI]

Rica Gonen

Elan Pavlov

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

On the Benefits of Adaptivity in Property Testing of Dense Graphs.

[BibT_eX]

[DOI]

Dana Ron

Proceedings of the Approximation, 2007

2005

A Geographic Directed Preferential Internet Topology Model.

[BibT_eX]

[DOI]

Sagy Bar

Avishai Wool

Proceedings of the 13th International Symposium on Modeling, 2005

2004

An Incremental Super-Linear Preferential Internet Topology Model: Extended Abstract.

[BibT_eX]

[DOI]

Sagy Bar