Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElad Verbin
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j10]Jeff M. Phillips, Elad Verbin, Qin Zhang
:
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. SIAM J. Comput. 45(1): 174-196 (2016)- 2013
- [j9]Elad Verbin, Qin Zhang:
The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model. SIAM J. Comput. 42(1): 212-229 (2013) - [j8]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9: 283-293 (2013) - [c22]Elad Verbin, Wei Yu:
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. CPM 2013: 247-258 - 2012
- [c21]Elad Verbin, Qin Zhang:
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. ICALP (1) 2012: 834-845 - [c20]Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin:
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT 2012: 96-107 - [c19]Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower bounds for number-in-hand multiparty communication complexity, made easy. SODA 2012: 486-501 - [i5]Shiteng Chen, Elad Verbin, Wei Yu:
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. CoRR abs/1203.1080 (2012) - [i4]Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin:
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j7]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. SIAM J. Comput. 40(3): 597-622 (2011) - [c18]Elad Verbin, Wei Yu:
The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. SODA 2011: 11-25 - [i3]Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. CoRR abs/1107.2559 (2011) - 2010
- [b1]Elad Verbin:
New results in stringology: Burrows-Wheeler compression and sorting by reversals. Tel Aviv University, Israel, 2010 - [j6]Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24(4): 1322-1335 (2010) - [c17]Joshua Brody, Elad Verbin:
The Coin Problem and Pseudorandomness for Branching Programs. FOCS 2010: 30-39 - [c16]Elad Verbin, Qin Zhang:
The limits of buffering: a tight lower bound for dynamic membership in the external memory model. STOC 2010: 447-456
2000 – 2009
- 2009
- [c15]Hongyi Yao, Elad Verbin:
Network coding is highly non-approximable. Allerton 2009: 209-213 - [c14]Itay Dar, Tova Milo, Elad Verbin:
Optimized union of non-disjoint distributed data sets. EDBT 2009: 12-23 - [c13]Christian Sommer, Elad Verbin, Wei Yu:
Distance Oracles for Sparse Graphs. FOCS 2009: 703-712 - [c12]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and selection in posets. SODA 2009: 392-401 - [c11]Maya Ben-Ari, Tova Milo, Elad Verbin:
Querying DAG-shaped Execution Traces Through Views. WebDB 2009 - [i2]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j5]Tova Milo, Assaf Sagi, Elad Verbin:
Compact samples for data dissemination. J. Comput. Syst. Sci. 74(5): 697-720 (2008) - [j4]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) - [c10]Leizhen Cai, Elad Verbin, Lin Yang:
Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC 2008: 258-269 - [c9]Adam Tauman Kalai, Yishay Mansour, Elad Verbin:
On agnostic boosting and parity learning. STOC 2008: 629-638 - 2007
- [j3]Haim Kaplan, Shir Landau, Elad Verbin:
A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007) - [c8]Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118 - [c7]Tova Milo, Assaf Sagi, Elad Verbin:
Compact Samples for Data Dissemination. ICDT 2007: 74-88 - [c6]Tova Milo, Tal Zur, Elad Verbin:
Boosting topic-based publish-subscribe systems with dynamic clustering. SIGMOD Conference 2007: 749-760 - [c5]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Counting colors in boxes. SODA 2007: 785-794 - [i1]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. CoRR abs/0707.1532 (2007) - 2006
- [c4]Haim Kaplan, Micha Sharir, Elad Verbin:
Colored intersection searching via sparse rectangular matrix multiplication. SCG 2006: 52-60 - [c3]Haim Kaplan, Shir Landau, Elad Verbin:
A Simpler Analysis of Burrows-Wheeler Based Compression. CPM 2006: 282-293 - [c2]Tzvika Hartman, Elad Verbin:
Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. SPIRE 2006: 279-290 - 2005
- [j2]Martin Charles Golumbic, Haim Kaplan, Elad Verbin:
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. 296(1): 25-41 (2005) - [j1]Haim Kaplan, Elad Verbin:
Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3): 321-341 (2005) - 2003
- [c1]Haim Kaplan, Elad Verbin:
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003: 170-185
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-05-08 23:54 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:
