default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Elad Verbin
@article{DBLP:journals/siamcomp/PhillipsVZ16,
author = {Jeff M. Phillips and
Elad Verbin and
Qin Zhang},
title = {Lower Bounds for Number-in-Hand Multiparty Communication Complexity,
Made Easy},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {1},
pages = {174--196},
year = {2016},
url = {https://doi.org/10.1137/15M1007525},
doi = {10.1137/15M1007525},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PhillipsVZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VerbinZ13,
author = {Elad Verbin and
Qin Zhang},
title = {The Limits of Buffering: {A} Tight Lower Bound for Dynamic Membership
in the External Memory Model},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {1},
pages = {212--229},
year = {2013},
url = {https://doi.org/10.1137/110842211},
doi = {10.1137/110842211},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VerbinZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BogdanovDVY13,
author = {Andrej Bogdanov and
Zeev Dvir and
Elad Verbin and
Amir Yehudayoff},
title = {Pseudorandomness for Width-2 Branching Programs},
journal = {Theory Comput.},
volume = {9},
pages = {283--293},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a007},
doi = {10.4086/TOC.2013.V009A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BogdanovDVY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/VerbinY13,
author = {Elad Verbin and
Wei Yu},
editor = {Johannes Fischer and
Peter Sanders},
title = {Data Structure Lower Bounds on Random Access to Grammar-Compressed
Strings},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {247--258},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_24},
doi = {10.1007/978-3-642-38905-4\_24},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/VerbinY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/VerbinZ12,
author = {Elad Verbin and
Qin Zhang},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Rademacher-Sketch: {A} Dimensionality-Reducing Embedding for Sum-Product
Norms, with an Application to Earth-Mover Distance},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {834--845},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_70},
doi = {10.1007/978-3-642-31594-7\_70},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/VerbinZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/EickmeyerHV12,
author = {Kord Eickmeyer and
Kristoffer Arnsfelt Hansen and
Elad Verbin},
editor = {Maria J. Serna},
title = {Approximating the Minmax Value of Three-Player Games within a Constant
is as Hard as Detecting Planted Cliques},
booktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
Barcelona, Spain, October 22-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7615},
pages = {96--107},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33996-7\_9},
doi = {10.1007/978-3-642-33996-7\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/EickmeyerHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PhillipsVZ12,
author = {Jeff M. Phillips and
Elad Verbin and
Qin Zhang},
editor = {Yuval Rabani},
title = {Lower bounds for number-in-hand multiparty communication complexity,
made easy},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {486--501},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.42},
doi = {10.1137/1.9781611973099.42},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/PhillipsVZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-1080,
author = {Shiteng Chen and
Elad Verbin and
Wei Yu},
title = {Data Structure Lower Bounds on Random Access to Grammar-Compressed
Strings},
journal = {CoRR},
volume = {abs/1203.1080},
year = {2012},
url = {http://arxiv.org/abs/1203.1080},
eprinttype = {arXiv},
eprint = {1203.1080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-1080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EickmeyerHV12,
author = {Kord Eickmeyer and
Kristoffer Arnsfelt Hansen and
Elad Verbin},
title = {Approximating the minmax value of 3-player games within a constant
is as hard as detecting planted cliques},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-025}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/025},
eprinttype = {ECCC},
eprint = {TR12-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EickmeyerHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisKMRV11,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
title = {Sorting and Selection in Posets},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {597--622},
year = {2011},
url = {https://doi.org/10.1137/070697720},
doi = {10.1137/070697720},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DaskalakisKMRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VerbinY11,
author = {Elad Verbin and
Wei Yu},
editor = {Dana Randall},
title = {The Streaming Complexity of Cycle Counting, Sorting by Reversals,
and Other Problems},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {11--25},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.2},
doi = {10.1137/1.9781611973082.2},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/VerbinY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-2559,
author = {Jeff M. Phillips and
Elad Verbin and
Qin Zhang},
title = {Lower Bounds for Number-in-Hand Multiparty Communication Complexity,
Made Easy},
journal = {CoRR},
volume = {abs/1107.2559},
year = {2011},
url = {http://arxiv.org/abs/1107.2559},
eprinttype = {arXiv},
eprint = {1107.2559},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-2559.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Verbin10,
author = {Elad Verbin},
title = {New results in stringology: Burrows-Wheeler compression and sorting
by reversals},
school = {Tel Aviv University, Israel},
year = {2010},
url = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990022372740204146},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Verbin10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaiCVZ10,
author = {Leizhen Cai and
Yongxi Cheng and
Elad Verbin and
Yuan Zhou},
title = {Surviving Rates of Graphs with Bounded Treewidth for the Firefighter
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1322--1335},
year = {2010},
url = {https://doi.org/10.1137/100791130},
doi = {10.1137/100791130},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CaiCVZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrodyV10,
author = {Joshua Brody and
Elad Verbin},
title = {The Coin Problem and Pseudorandomness for Branching Programs},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {30--39},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.10},
doi = {10.1109/FOCS.2010.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrodyV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/VerbinZ10,
author = {Elad Verbin and
Qin Zhang},
editor = {Leonard J. Schulman},
title = {The limits of buffering: a tight lower bound for dynamic membership
in the external memory model},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {447--456},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806752},
doi = {10.1145/1806689.1806752},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/VerbinZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/YaoV09,
author = {Hongyi Yao and
Elad Verbin},
title = {Network coding is highly non-approximable},
booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},
pages = {209--213},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ALLERTON.2009.5394818},
doi = {10.1109/ALLERTON.2009.5394818},
timestamp = {Wed, 29 Nov 2023 20:15:57 +0100},
biburl = {https://dblp.org/rec/conf/allerton/YaoV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/DarMV09,
author = {Itay Dar and
Tova Milo and
Elad Verbin},
editor = {Martin L. Kersten and
Boris Novikov and
Jens Teubner and
Vladimir Polutin and
Stefan Manegold},
title = {Optimized union of non-disjoint distributed data sets},
booktitle = {{EDBT} 2009, 12th International Conference on Extending Database Technology,
Saint Petersburg, Russia, March 24-26, 2009, Proceedings},
series = {{ACM} International Conference Proceeding Series},
volume = {360},
pages = {12--23},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1516360.1516364},
doi = {10.1145/1516360.1516364},
timestamp = {Wed, 04 May 2022 13:02:27 +0200},
biburl = {https://dblp.org/rec/conf/edbt/DarMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SommerVY09,
author = {Christian Sommer and
Elad Verbin and
Wei Yu},
title = {Distance Oracles for Sparse Graphs},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {703--712},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.27},
doi = {10.1109/FOCS.2009.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SommerVY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaskalakisKMRV09,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
editor = {Claire Mathieu},
title = {Sorting and selection in posets},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {392--401},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.44},
doi = {10.1137/1.9781611973068.44},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaskalakisKMRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/webdb/Ben-AriMV09,
author = {Maya Ben{-}Ari and
Tova Milo and
Elad Verbin},
title = {Querying DAG-shaped Execution Traces Through Views},
booktitle = {12th International Workshop on the Web and Databases, WebDB 2009,
Providence, Rhode Island, USA, June 28, 2009},
year = {2009},
url = {http://webdb09.cse.buffalo.edu/papers/Paper2/BMV09.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/webdb/Ben-AriMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovDVY09,
author = {Andrej Bogdanov and
Zeev Dvir and
Elad Verbin and
Amir Yehudayoff},
title = {Pseudorandomness for Width 2 Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-070}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/070},
eprinttype = {ECCC},
eprint = {TR09-070},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovDVY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MiloSV08,
author = {Tova Milo and
Assaf Sagi and
Elad Verbin},
title = {Compact samples for data dissemination},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {5},
pages = {697--720},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.07.012},
doi = {10.1016/J.JCSS.2007.07.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MiloSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanRSV08,
author = {Haim Kaplan and
Natan Rubin and
Micha Sharir and
Elad Verbin},
title = {Efficient Colored Orthogonal Range Counting},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {982--1011},
year = {2008},
url = {https://doi.org/10.1137/070684483},
doi = {10.1137/070684483},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaplanRSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CaiVY08,
author = {Leizhen Cai and
Elad Verbin and
Lin Yang},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability
and a Subexponential Algorithm},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {258--269},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_25},
doi = {10.1007/978-3-540-92182-0\_25},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CaiVY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KalaiMV08,
author = {Adam Tauman Kalai and
Yishay Mansour and
Elad Verbin},
editor = {Cynthia Dwork},
title = {On agnostic boosting and parity learning},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {629--638},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374466},
doi = {10.1145/1374376.1374466},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KalaiMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaplanLV07,
author = {Haim Kaplan and
Shir Landau and
Elad Verbin},
title = {A simpler analysis of Burrows-Wheeler-based compression},
journal = {Theor. Comput. Sci.},
volume = {387},
number = {3},
pages = {220--235},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.07.020},
doi = {10.1016/J.TCS.2007.07.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaplanLV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KaplanV07,
author = {Haim Kaplan and
Elad Verbin},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Most Burrows-Wheeler Based Compressors Are Not Optimal},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {107--118},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_13},
doi = {10.1007/978-3-540-73437-6\_13},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KaplanV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/MiloSV07,
author = {Tova Milo and
Assaf Sagi and
Elad Verbin},
editor = {Thomas Schwentick and
Dan Suciu},
title = {Compact Samples for Data Dissemination},
booktitle = {Database Theory - {ICDT} 2007, 11th International Conference, Barcelona,
Spain, January 10-12, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4353},
pages = {74--88},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/11965893\_6},
doi = {10.1007/11965893\_6},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/icdt/MiloSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/MiloZV07,
author = {Tova Milo and
Tal Zur and
Elad Verbin},
editor = {Chee Yong Chan and
Beng Chin Ooi and
Aoying Zhou},
title = {Boosting topic-based publish-subscribe systems with dynamic clustering},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management
of Data, Beijing, China, June 12-14, 2007},
pages = {749--760},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247480.1247563},
doi = {10.1145/1247480.1247563},
timestamp = {Thu, 11 Mar 2021 15:20:15 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/MiloZV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanRSV07,
author = {Haim Kaplan and
Natan Rubin and
Micha Sharir and
Elad Verbin},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Counting colors in boxes},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {785--794},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283467},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/KaplanRSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-1532,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
title = {Sorting and Selection in Posets},
journal = {CoRR},
volume = {abs/0707.1532},
year = {2007},
url = {http://arxiv.org/abs/0707.1532},
eprinttype = {arXiv},
eprint = {0707.1532},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-1532.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KaplanSV06,
author = {Haim Kaplan and
Micha Sharir and
Elad Verbin},
editor = {Nina Amenta and
Otfried Cheong},
title = {Colored intersection searching via sparse rectangular matrix multiplication},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
Sedona, Arizona, USA, June 5-7, 2006},
pages = {52--60},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1137856.1137866},
doi = {10.1145/1137856.1137866},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KaplanSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KaplanLV06,
author = {Haim Kaplan and
Shir Landau and
Elad Verbin},
editor = {Moshe Lewenstein and
Gabriel Valiente},
title = {A Simpler Analysis of Burrows-Wheeler Based Compression},
booktitle = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
Barcelona, Spain, July 5-7, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4009},
pages = {282--293},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780441\_26},
doi = {10.1007/11780441\_26},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/KaplanLV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/HartmanV06,
author = {Tzvika Hartman and
Elad Verbin},
editor = {Fabio Crestani and
Paolo Ferragina and
Mark Sanderson},
title = {Matrix Tightness: {A} Linear-Algebraic Framework for Sorting by Transpositions},
booktitle = {String Processing and Information Retrieval, 13th International Conference,
{SPIRE} 2006, Glasgow, UK, October 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4209},
pages = {279--290},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11880561\_23},
doi = {10.1007/11880561\_23},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/HartmanV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GolumbicKV05,
author = {Martin Charles Golumbic and
Haim Kaplan and
Elad Verbin},
title = {On the complexity of cell flipping in permutation diagrams and multiprocessor
scheduling problems},
journal = {Discret. Math.},
volume = {296},
number = {1},
pages = {25--41},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.08.042},
doi = {10.1016/J.DISC.2004.08.042},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GolumbicKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KaplanV05,
author = {Haim Kaplan and
Elad Verbin},
title = {Sorting signed permutations by reversals, revisited},
journal = {J. Comput. Syst. Sci.},
volume = {70},
number = {3},
pages = {321--341},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.12.002},
doi = {10.1016/J.JCSS.2004.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KaplanV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KaplanV03,
author = {Haim Kaplan and
Elad Verbin},
editor = {Ricardo A. Baeza{-}Yates and
Edgar Ch{\'{a}}vez and
Maxime Crochemore},
title = {Efficient Data Structures and a New Randomized Approach for Sorting
Signed Permutations by Reversals},
booktitle = {Combinatorial Pattern Matching, 14th Annual Symposium, {CPM} 2003,
Morelia, Michoc{\'{a}}n, Mexico, June 25-27, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2676},
pages = {170--185},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44888-8\_13},
doi = {10.1007/3-540-44888-8\_13},
timestamp = {Sun, 25 Oct 2020 23:06:11 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KaplanV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-05-08 21:49 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:
