default search action
Mira Gonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Mira Gonen
, Ishay Haviv
Minimizing the Alphabet Size in Codes With Restricted Error Sets. IEEE Trans. Inf. Theory 70(6): 3891-3902 (2024) - 2022
- [j13]Mira Gonen
Latency and Alphabet Size in the Context of Multicast Network Coding. IEEE Trans. Inf. Theory 68(7): 4289-4300 (2022) - [c16]Mira Gonen, Michael Langberg, Alex Sprintson:
Group Testing on General Set-Systems. ISIT 2022: 874-879 - [i9]Mira Gonen, Michael Langberg, Alex Sprintson:
Group Testing on General Set-Systems. CoRR abs/2202.04988 (2022) - 2021
- [c15]Mira Gonen, Michael Langberg, Alex Sprintson:
Minimizing the Alphabet Size in Codes with Restricted Error Sets. ISIT 2021: 940-945 - [i8]Mira Gonen, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size in codes with restricted error sets. CoRR abs/2102.02608 (2021) - 2020
- [j12]Noam Hazon
Probabilistic physical search on general graphs: approximations and heuristics. Auton. Agents Multi Agent Syst. 34(1): 1 (2020) - [c14]Noam Hazon, Mira Gonen:
Probabilistic Physical Search on General Graphs: Approximations and Heuristics. AAMAS 2020: 2143-2145 - [c13]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. ISIT 2020: 144-149 - [i7]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. CoRR abs/2005.06947 (2020)
2010 – 2019
- 2019
- [j11]Reuven Cohen
On interval and circular-arc covering problems. Ann. Oper. Res. 275(2): 281-295 (2019) - [j10]Mira Gonen, Dana Shapira
Edit Distance with Multiple Block Operations†. Comput. J. 62(5): 657-669 (2019) - 2018
- [c12]Mira Gonen, Michael Langberg, Alex Sprintson:
Latency and Alphabet Size in the Context of Multicast Network Coding. Allerton 2018: 212-218 - 2017
- [j9]Reuven Cohen
On nonlinear multi-covering problems. J. Comb. Optim. 33(2): 645-659 (2017) - 2015
- [j8]Mira Gonen, Michael Langberg:
Coded Cooperative Data Exchange Problem for General Topologies. IEEE Trans. Inf. Theory 61(10): 5656-5669 (2015) - [i6]Noam Hazon, Mira Gonen, Max Kleb:
Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs. CoRR abs/1509.08088 (2015) - 2012
- [c11]Mira Gonen, Michael Langberg:
Coded cooperative data exchange problem for general topologies. ISIT 2012: 2606-2610 - [i5]Mira Gonen, Michael Langberg:
Coded Cooperative Data Exchange Problem for General Topologies. CoRR abs/1202.2088 (2012) - 2011
- [j7]Mira Gonen, Dana Ron
Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM J. Discret. Math. 25(3): 1365-1411 (2011) - [c10]Jonathan Stern
An Optimal Topology for a Static P2P Live Streaming Network with Limited Resources. ICPADS 2011: 729-734 - [c9]Jonathan Stern
An optimal topology for a static P2P live streaming network: Analysis and real-world results. Peer-to-Peer Computing 2011: 170-171 - 2010
- [j6]Mira Gonen, Dana Ron
On the Benefits of Adaptivity in Property Testing of Dense Graphs. Algorithmica 58(4): 811-830 (2010) - [c8]Mira Gonen, Dana Ron, Yuval Shavitt
Counting Stars and Other Small Subgraphs in Sublinear Time. SODA 2010: 99-116
2000 – 2009
- 2009
- [j5]Mira Gonen, Yuval Shavitt
Approximating the Number of Network Motifs. Internet Math. 6(3): 349-372 (2009) - [j4]Mira Gonen, Yuval Shavitt
A Theta(logn. Inf. Process. Lett. 109(3): 183-186 (2009) - [c7]Mira Gonen, Yuval Shavitt
Approximating the Number of Network Motifs. WAW 2009: 13-24 - [i4]Dana Ron, Mira Gonen, Yuval Shavitt:
Counting Stars and Other Small Subgraphs in Sublinear Time. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j3]Mira Gonen, Dana Ron
Finding a dense-core in Jellyfish graphs. Comput. Networks 52(15): 2831-2841 (2008) - [j2]Reuven Cohen, Mira Gonen, Avishai Wool
Bounding the bias of tree-like sampling in IP topologies. Networks Heterog. Media 3(2): 323-332 (2008) - [i3]Mira Gonen, Yuval Shavitt:
An O(log n)-approximation for the Set Cover Problem with Set Ownership. CoRR abs/0807.3326 (2008) - 2007
- [j1]Sagy Bar, Mira Gonen, Avishai Wool
A geographic directed preferential internet topology model. Comput. Networks 51(14): 4174-4188 (2007) - [c6]Mira Gonen, Dana Ron:
On the Benefits of Adaptivity in Property Testing of Dense Graphs. APPROX-RANDOM 2007: 525-539 - [c5]Mira Gonen, Rica Gonen, Elan Pavlov:
Generalized trade reduction mechanisms. EC 2007: 20-29 - [c4]Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
Finding a Dense-Core in Jellyfish Graphs. WAW 2007: 29-40 - [c3]Mira Gonen, Rica Gonen, Elan Pavlov:
Characterizing Truthful Market Design. WINE 2007: 590-595 - 2006
- [i2]Reuven Cohen, Mira Gonen, Avishai Wool:
Bounding the Bias of Tree-Like Sampling in IP Topologies. CoRR abs/cs/0611157 (2006) - 2005
- [c2]Sagy Bar, Mira Gonen, Avishai Wool
A Geographic Directed Preferential Internet Topology Model. MASCOTS 2005: 325-328 - [i1]Sagy Bar, Mira Gonen, Avishai Wool:
A Geographic Directed Preferential Internet Topology Model. CoRR abs/cs/0502061 (2005) - 2004
- [c1]Sagy Bar, Mira Gonen, Avishai Wool
An Incremental Super-Linear Preferential Internet Topology Model: Extended Abstract. PAM 2004: 53-62
Coauthor Index
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 2024-10-07 21:23 CEST 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: