Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mihai Patrascu
@article{DBLP:journals/talg/PatrascuT16,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {On the \emph{k}-Independence Required by Linear Probing and Minwise
Independence},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {8:1--8:27},
year = {2016},
url = {https://doi.org/10.1145/2716317},
doi = {10.1145/2716317},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/PatrascuT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Patrascu16,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Lower Bounds for Dynamic Connectivity},
booktitle = {Encyclopedia of Algorithms},
pages = {1162--1167},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_214},
doi = {10.1007/978-1-4939-2864-4\_214},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Patrascu16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Patrascu16a,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Predecessor Search},
booktitle = {Encyclopedia of Algorithms},
pages = {1601--1605},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_298},
doi = {10.1007/978-1-4939-2864-4\_298},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Patrascu16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeameLP15,
author = {Paul Beame and
Vincent Liew and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Finding the Median (Obliviously) with Bounded Space},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {103--115},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_9},
doi = {10.1007/978-3-662-47672-7\_9},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BeameLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isie/KulkarniPVWPN15,
author = {Anupama Kulkarni and
Mihai P{u{a}}tra{c{s}}cu and
Yuri van de Vijver and
Jaap van Wensveen and
Robert Pijnenburg and
Stoyan Nihtianov},
title = {Investigation of long-term drift of {NTC} temperature sensors with
less than 1 mK uncertainty},
booktitle = {24th {IEEE} International Symposium on Industrial Electronics, {ISIE}
2015, Rio de Janeiro, Brazil, June 3-5, 2015},
pages = {150--155},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ISIE.2015.7281460},
doi = {10.1109/ISIE.2015.7281460},
timestamp = {Mon, 01 Feb 2021 17:14:46 +0100},
biburl = {https://dblp.org/rec/conf/isie/KulkarniPVWPN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeameLP15,
author = {Paul Beame and
Vincent Liew and
Mihai P{u{a}}tra{c{s}}cu},
title = {Finding the Median (Obliviously) with Bounded Space},
journal = {CoRR},
volume = {abs/1505.00090},
year = {2015},
url = {http://arxiv.org/abs/1505.00090},
eprinttype = {arXiv},
eprint = {1505.00090},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeameLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BremnerCDEHILPT14,
author = {David Bremner and
Timothy M. Chan and
Erik D. Demaine and
Jeff Erickson and
Ferran Hurtado and
John Iacono and
Stefan Langerman and
Mihai P{u{a}}tra{c{s}}cu and
Perouz Taslakian},
title = {Necklaces, Convolutions, and {X+Y}},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {294--314},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9734-3},
doi = {10.1007/S00453-012-9734-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BremnerCDEHILPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DemaineDMMRP14,
author = {Erik D. Demaine and
Martin L. Demaine and
Yair N. Minsky and
Joseph S. B. Mitchell and
Ronald L. Rivest and
Mihai P{u{a}}tra{c{s}}cu},
title = {Picture-Hanging Puzzles},
journal = {Theory Comput. Syst.},
volume = {54},
number = {4},
pages = {531--550},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9501-0},
doi = {10.1007/S00224-013-9501-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DemaineDMMRP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatrascuR14,
author = {Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty},
title = {Distance Oracles beyond the Thorup-Zwick Bound},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {1},
pages = {300--311},
year = {2014},
url = {https://doi.org/10.1137/11084128X},
doi = {10.1137/11084128X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PatrascuR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatrascuT14,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {166--175},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.26},
doi = {10.1109/FOCS.2014.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatrascuT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PatrascuT14,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search},
journal = {CoRR},
volume = {abs/1408.3045},
year = {2014},
url = {http://arxiv.org/abs/1408.3045},
eprinttype = {arXiv},
eprint = {1408.3045},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PatrascuT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatrascuT13,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Sanjeev Khanna},
title = {Twisted Tabulation Hashing},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {209--228},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.16},
doi = {10.1137/1.9781611973105.16},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/PatrascuT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PatrascuT12,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {The Power of Simple Tabulation Hashing},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {14:1--14:50},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220361},
doi = {10.1145/2220357.2220361},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PatrascuT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatrascuRT12,
author = {Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty and
Mikkel Thorup},
title = {A New Infinity of Distance Oracles for Sparse Graphs},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {738--747},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.44},
doi = {10.1109/FOCS.2012.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatrascuRT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/DemaineDMMRP12,
author = {Erik D. Demaine and
Martin L. Demaine and
Yair N. Minsky and
Joseph S. B. Mitchell and
Ronald L. Rivest and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Picture-Hanging Puzzles},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {81--93},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_11},
doi = {10.1007/978-3-642-30347-0\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/DemaineDMMRP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IaconoP12,
author = {John Iacono and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Yuval Rabani},
title = {Using hashing to solve the dictionary problem},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {570--582},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.48},
doi = {10.1137/1.9781611973099.48},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/IaconoP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3602,
author = {Erik D. Demaine and
Martin L. Demaine and
Yair N. Minsky and
Joseph S. B. Mitchell and
Ronald L. Rivest and
Mihai P{u{a}}tra{c{s}}cu},
title = {Picture-Hanging Puzzles},
journal = {CoRR},
volume = {abs/1203.3602},
year = {2012},
url = {http://arxiv.org/abs/1203.3602},
eprinttype = {arXiv},
eprint = {1203.3602},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-3602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4771,
author = {David Bremner and
Timothy M. Chan and
Erik D. Demaine and
Jeff Erickson and
Ferran Hurtado and
John Iacono and
Stefan Langerman and
Mihai P{u{a}}tra{c{s}}cu and
Perouz Taslakian},
title = {Necklaces, Convolutions, and {X+Y}},
journal = {CoRR},
volume = {abs/1212.4771},
year = {2012},
url = {http://arxiv.org/abs/1212.4771},
eprinttype = {arXiv},
eprint = {1212.4771},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-4771.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanPR11,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty},
title = {Dynamic Connectivity: Connecting to Networks and Geometry},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {333--349},
year = {2011},
url = {https://doi.org/10.1137/090751670},
doi = {10.1137/090751670},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Patrascu11,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Unifying the Landscape of Cell-Probe Lower Bounds},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {827--847},
year = {2011},
url = {https://doi.org/10.1137/09075336X},
doi = {10.1137/09075336X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Patrascu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChanLP11,
author = {Timothy M. Chan and
Kasper Green Larsen and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Ferran Hurtado and
Marc J. van Kreveld},
title = {Orthogonal range searching on the RAM, revisited},
booktitle = {Proceedings of the 27th {ACM} Symposium on Computational Geometry,
Paris, France, June 13-15, 2011},
pages = {1--10},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1998196.1998198},
doi = {10.1145/1998196.1998198},
timestamp = {Mon, 14 Jun 2021 16:24:49 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChanLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatrascuT11,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {The power of simple tabulation hashing},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {1--10},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993638},
doi = {10.1145/1993636.1993638},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PatrascuT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatrascuT11a,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Don't rush into a union: take time to find your roots},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {559--568},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993711},
doi = {10.1145/1993636.1993711},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PatrascuT11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1783,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Don't Rush into a Union: Take Time to Find Your Roots},
journal = {CoRR},
volume = {abs/1102.1783},
year = {2011},
url = {http://arxiv.org/abs/1102.1783},
eprinttype = {arXiv},
eprint = {1102.1783},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-5510,
author = {Timothy M. Chan and
Kasper Green Larsen and
Mihai P{u{a}}tra{c{s}}cu},
title = {Orthogonal Range Searching on the RAM, Revisited},
journal = {CoRR},
volume = {abs/1103.5510},
year = {2011},
url = {http://arxiv.org/abs/1103.5510},
eprinttype = {arXiv},
eprint = {1103.5510},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-5510.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2799,
author = {John Iacono and
Mihai P{u{a}}tra{c{s}}cu},
title = {Using Hashing to Solve the Dictionary Problem (In External Memory)},
journal = {CoRR},
volume = {abs/1104.2799},
year = {2011},
url = {http://arxiv.org/abs/1104.2799},
eprinttype = {arXiv},
eprint = {1104.2799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2799.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatrascuR10,
author = {Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty},
title = {Distance Oracles beyond the Thorup-Zwick Bound},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {815--823},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.83},
doi = {10.1109/FOCS.2010.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatrascuR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PatrascuT10,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {On the \emph{k}-Independence Required by Linear Probing and Minwise
Independence},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {715--726},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_60},
doi = {10.1007/978-3-642-14165-2\_60},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/PatrascuT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatrascuV10,
author = {Mihai P{u{a}}tra{c{s}}cu and
Emanuele Viola},
editor = {Moses Charikar},
title = {Cell-Probe Lower Bounds for Succinct Partial Sums},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {117--122},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.11},
doi = {10.1137/1.9781611973075.11},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/PatrascuV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChanP10,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Moses Charikar},
title = {Counting Inversions, Offline Orthogonal Range Counting, and Related
Problems},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {161--173},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.15},
doi = {10.1137/1.9781611973075.15},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChanP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AndoniJP10,
author = {Alexandr Andoni and
T. S. Jayram and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Moses Charikar},
title = {Lower Bounds for Edit Distance and Product Metrics via Poincar{\'{e}}-Type
Inequalities},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {184--192},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.17},
doi = {10.1137/1.9781611973075.17},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AndoniJP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatrascuW10,
author = {Mihai P{u{a}}tra{c{s}}cu and
Ryan Williams},
editor = {Moses Charikar},
title = {On the Possibility of Faster {SAT} Algorithms},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1065--1075},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.86},
doi = {10.1137/1.9781611973075.86},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/PatrascuW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DodisPT10,
author = {Yevgeniy Dodis and
Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Leonard J. Schulman},
title = {Changing base without losing space},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {593--602},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806771},
doi = {10.1145/1806689.1806771},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DodisPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Patrascu10,
author = {Mihai P{u{a}}tra{c{s}}cu},
editor = {Leonard J. Schulman},
title = {Towards polynomial lower bounds for dynamic problems},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {603--610},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806772},
doi = {10.1145/1806689.1806772},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Patrascu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-1948,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu},
title = {Transdichotomous Results in Computational Geometry, {II:} Offline
Search},
journal = {CoRR},
volume = {abs/1010.1948},
year = {2010},
url = {http://arxiv.org/abs/1010.1948},
eprinttype = {arXiv},
eprint = {1010.1948},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-1948.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-3783,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Unifying the Landscape of Cell-Probe Lower Bounds},
journal = {CoRR},
volume = {abs/1010.3783},
year = {2010},
url = {http://arxiv.org/abs/1010.3783},
eprinttype = {arXiv},
eprint = {1010.3783},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-3783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-5200,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {The Power of Simple Tabulation Hashing},
journal = {CoRR},
volume = {abs/1011.5200},
year = {2010},
url = {http://arxiv.org/abs/1011.5200},
eprinttype = {arXiv},
eprint = {1011.5200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-5200.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PawlewiczP09,
author = {Jakub Pawlewicz and
Mihai P{u{a}}tra{c{s}}cu},
title = {Order Statistics in the Farey Sequences in Sublinear Time and Counting
Primitive Lattice Points in Polygons},
journal = {Algorithmica},
volume = {55},
number = {2},
pages = {271--282},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9221-z},
doi = {10.1007/S00453-008-9221-Z},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PawlewiczP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanP09,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu},
title = {Transdichotomous Results in Computational Geometry, {I:} Point Location
in Sublogarithmic Time},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {703--729},
year = {2009},
url = {https://doi.org/10.1137/07068669X},
doi = {10.1137/07068669X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatrascuT09,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Higher Lower Bounds for Near-Neighbor and Further Rich Problems},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {730--741},
year = {2009},
url = {https://doi.org/10.1137/070684859},
doi = {10.1137/070684859},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PatrascuT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemaineHIKP09,
author = {Erik D. Demaine and
Dion Harmon and
John Iacono and
Daniel Kane and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Claire Mathieu},
title = {The geometry of binary search trees},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {496--505},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.55},
doi = {10.1137/1.9781611973068.55},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DemaineHIKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-1103,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {A Lower Bound for Succinct Rank Queries},
journal = {CoRR},
volume = {abs/0907.1103},
year = {2009},
url = {http://arxiv.org/abs/0907.1103},
eprinttype = {arXiv},
eprint = {0907.1103},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-1103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Patrascu08,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Lower bound techniques for data structures},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {2008},
url = {https://hdl.handle.net/1721.1/45866},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Patrascu08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaranDP08,
author = {Ilya Baran and
Erik D. Demaine and
Mihai P{u{a}}tra{c{s}}cu},
title = {Subquadratic Algorithms for 3SUM},
journal = {Algorithmica},
volume = {50},
number = {4},
pages = {584--596},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9036-3},
doi = {10.1007/S00453-007-9036-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BaranDP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChanPR08,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty},
title = {Dynamic Connectivity: Connecting to Networks and Geometry},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {95--104},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.29},
doi = {10.1109/FOCS.2008.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChanPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Patrascu08,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Succincter},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {305--313},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.83},
doi = {10.1109/FOCS.2008.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Patrascu08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniCP08,
author = {Alexandr Andoni and
Dorian Croitoru and
Mihai P{u{a}}tra{c{s}}cu},
title = {Hardness of Nearest Neighbor under L-infinity},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {424--433},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.89},
doi = {10.1109/FOCS.2008.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniCP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Patrascu08a,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {(Data) {STRUCTURES}},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {434--443},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.69},
doi = {10.1109/FOCS.2008.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Patrascu08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/AndoniFKPS08,
author = {Alexandr Andoni and
Ronald Fagin and
Ravi Kumar and
Mihai P{u{a}}tra{c{s}}cu and
D. Sivakumar},
editor = {Jason Tsong{-}Li Wang},
title = {Corrigendum to "efficient similarity search and classification
via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar
(proc. SIGMOD'03)},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management
of Data, {SIGMOD} 2008, Vancouver, BC, Canada, June 10-12, 2008},
pages = {1375--1376},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1376616.1376778},
doi = {10.1145/1376616.1376778},
timestamp = {Tue, 16 Aug 2022 23:04:20 +0200},
biburl = {https://dblp.org/rec/conf/sigmod/AndoniFKPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartiJP08,
author = {Amit Chakrabarti and
T. S. Jayram and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Shang{-}Hua Teng},
title = {Tight lower bounds for selection in randomly ordered streams},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {720--729},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347161},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartiJP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Patrascu08,
author = {Mihai P{u{a}}tra{c{s}}cu},
editor = {Ming{-}Yang Kao},
title = {Lower Bounds for Dynamic Connectivity},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_214},
doi = {10.1007/978-0-387-30162-4\_214},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Patrascu08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Patrascu08a,
author = {Mihai P{u{a}}tra{c{s}}cu},
editor = {Ming{-}Yang Kao},
title = {Predecessor Search},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_298},
doi = {10.1007/978-0-387-30162-4\_298},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Patrascu08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0808-1128,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu and
Liam Roditty},
title = {Dynamic Connectivity: Connecting to Networks and Geometry},
journal = {CoRR},
volume = {abs/0808.1128},
year = {2008},
url = {http://arxiv.org/abs/0808.1128},
eprinttype = {arXiv},
eprint = {0808.1128},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0808-1128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DemaineHIP07,
author = {Erik D. Demaine and
Dion Harmon and
John Iacono and
Mihai P{u{a}}tra{c{s}}cu},
title = {Dynamic Optimality - Almost},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {1},
pages = {240--251},
year = {2007},
url = {https://doi.org/10.1137/S0097539705447347},
doi = {10.1137/S0097539705447347},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DemaineHIP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PatrascuT07,
author = {Mihai P{u{a}}tra{c{s}}cu and
Corina E. Tarnita},
title = {On dynamic bit-probe complexity},
journal = {Theor. Comput. Sci.},
volume = {380},
number = {1-2},
pages = {127--142},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.058},
doi = {10.1016/J.TCS.2007.02.058},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PatrascuT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DemaineP07,
author = {Erik D. Demaine and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Jeff Erickson},
title = {Tight bounds for dynamic convex hull queries (again)},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {354--363},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247131},
doi = {10.1145/1247069.1247131},
timestamp = {Mon, 14 Jun 2021 16:25:02 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DemaineP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FranceschiniMP07,
author = {Gianni Franceschini and
S. Muthukrishnan and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {Radix Sorting with No Extra Space},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {194--205},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_19},
doi = {10.1007/978-3-540-75520-3\_19},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FranceschiniMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatrascuT07,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Planning for Fast Connectivity Updates},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {263--271},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.54},
doi = {10.1109/FOCS.2007.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatrascuT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/HarveyPWYC07,
author = {Nicholas J. A. Harvey and
Mihai P{u{a}}tra{c{s}}cu and
Yonggang Wen and
Sergey Yekhanin and
Vincent W. S. Chan},
title = {Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial
Group Testing on Graphs},
booktitle = {{INFOCOM} 2007. 26th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
6-12 May 2007, Anchorage, Alaska, {USA}},
pages = {697--705},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/INFCOM.2007.87},
doi = {10.1109/INFCOM.2007.87},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/HarveyPWYC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatrascuT07,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Randomization does not help searching predecessors},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {555--564},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283443},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/PatrascuT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChanP07,
author = {Timothy M. Chan and
Mihai P{u{a}}tra{c{s}}cu},
editor = {David S. Johnson and
Uriel Feige},
title = {Voronoi diagrams in n{\(\cdot\)}2\({}^{\mbox{osqrt(lg lg n)}}\) time},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {31--39},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250796},
doi = {10.1145/1250790.1250796},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChanP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Patrascu07,
author = {Mihai P{u{a}}tra{c{s}}cu},
editor = {David S. Johnson and
Uriel Feige},
title = {Lower bounds for 2-dimensional range counting},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {40--46},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250797},
doi = {10.1145/1250790.1250797},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Patrascu07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0706-4107,
author = {Gianni Franceschini and
S. Muthukrishnan and
Mihai P{u{a}}tra{c{s}}cu},
title = {Radix Sorting With No Extra Space},
journal = {CoRR},
volume = {abs/0706.4107},
year = {2007},
url = {http://arxiv.org/abs/0706.4107},
eprinttype = {arXiv},
eprint = {0706.4107},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0706-4107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatrascuD06,
author = {Mihai P{u{a}}tra{c{s}}cu and
Erik D. Demaine},
title = {Logarithmic Lower Bounds in the Cell-Probe Model},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {4},
pages = {932--963},
year = {2006},
url = {https://doi.org/10.1137/S0097539705447256},
doi = {10.1137/S0097539705447256},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PatrascuD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Patrascu06,
author = {Mihai P{u{a}}tra{c{s}}cu},
title = {Planar Point Location in Sublogarithmic Time},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {325--332},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.61},
doi = {10.1109/FOCS.2006.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Patrascu06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniIP06,
author = {Alexandr Andoni and
Piotr Indyk and
Mihai P{u{a}}tra{c{s}}cu},
title = {On the Optimality of the Dimensionality Reduction Method},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {449--458},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.56},
doi = {10.1109/FOCS.2006.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniIP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatrascuT06,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Higher Lower Bounds for Near-Neighbor and Further Rich Problems},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {646--654},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.35},
doi = {10.1109/FOCS.2006.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatrascuT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DemaineHPP06,
author = {Erik D. Demaine and
Friedhelm Meyer auf der Heide and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {De Dictionariis Dynamicis Pauco Spatio Utentibus (\emph{lat.} On Dynamic
Dictionaries Using Little Space)},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {349--361},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_34},
doi = {10.1007/11682462\_34},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DemaineHPP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdlerDHP06,
author = {Micah Adler and
Erik D. Demaine and
Nicholas J. A. Harvey and
Mihai P{u{a}}tra{c{s}}cu},
title = {Lower bounds for asymmetric communication channels and distributed
source coding},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {251--260},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109586},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AdlerDHP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BergerHPPRT06,
author = {Mette Berger and
Esben Rune Hansen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu and
Milan Ruzic and
Peter Tiedemann},
editor = {Phillip B. Gibbons and
Uzi Vishkin},
title = {Deterministic load balancing and dictionaries in the parallel disk
model},
booktitle = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Cambridge, Massachusetts, USA, July
30 - August 2, 2006},
pages = {299--307},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1148109.1148160},
doi = {10.1145/1148109.1148160},
timestamp = {Wed, 21 Nov 2018 11:13:10 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BergerHPPRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatrascuT06,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
editor = {Jon M. Kleinberg},
title = {Time-space trade-offs for predecessor search},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {232--240},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132551},
doi = {10.1145/1132516.1132551},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PatrascuT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603043,
author = {Mihai P{u{a}}tra{c{s}}cu and
Mikkel Thorup},
title = {Time-Space Trade-Offs for Predecessor Search},
journal = {CoRR},
volume = {abs/cs/0603043},
year = {2006},
url = {http://arxiv.org/abs/cs/0603043},
eprinttype = {arXiv},
eprint = {cs/0603043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PatrascuP05,
author = {Corina E. Patrascu and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {On Dynamic Bit-Probe Complexity},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {969--981},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_78},
doi = {10.1007/11523468\_78},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/PatrascuP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icmens/PatrascuS05,
author = {Mihai P{u{a}}tra{c{s}}cu and
Stefano Stramigioli},
title = {Stick-slip Actuation of Electrostatic Stepper Micropositioners for
Data Storage - the {\(\mathrm{\mu}\)}Walker},
booktitle = {2005 International Conference on MEMS, NANO, and Smart Systems {(ICMENS}
2005), 24-27 July 2005, Banff, Alberta, Canada},
pages = {81--86},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/ICMENS.2005.112},
doi = {10.1109/ICMENS.2005.112},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icmens/PatrascuS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MortensenPP05,
author = {Christian Worm Mortensen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {On dynamic range reporting in one dimension},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {104--111},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060606},
doi = {10.1145/1060590.1060606},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MortensenPP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BaranDP05,
author = {Ilya Baran and
Erik D. Demaine and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Subquadratic Algorithms for 3SUM},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {409--421},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_36},
doi = {10.1007/11534273\_36},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BaranDP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0502032,
author = {Christian Worm Mortensen and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
title = {On Dynamic Range Reporting in One Dimension},
journal = {CoRR},
volume = {abs/cs/0502032},
year = {2005},
url = {http://arxiv.org/abs/cs/0502032},
eprinttype = {arXiv},
eprint = {cs/0502032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0502032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0502041,
author = {Mihai P{u{a}}tra{c{s}}cu and
Erik D. Demaine},
title = {Logarithmic Lower Bounds in the Cell-Probe Model},
journal = {CoRR},
volume = {abs/cs/0502041},
year = {2005},
url = {http://arxiv.org/abs/cs/0502041},
eprinttype = {arXiv},
eprint = {cs/0502041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0502041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512081,
author = {Erik D. Demaine and
Friedhelm Meyer auf der Heide and
Rasmus Pagh and
Mihai P{u{a}}tra{c{s}}cu},
title = {De Dictionariis Dynamicis Pauco Spatio Utentibus},
journal = {CoRR},
volume = {abs/cs/0512081},
year = {2005},
url = {http://arxiv.org/abs/cs/0512081},
eprinttype = {arXiv},
eprint = {cs/0512081},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0512081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ants/PatrascuP04,
author = {Corina E. Patrascu and
Mihai P{u{a}}tra{c{s}}cu},
editor = {Duncan A. Buell},
title = {Computing Order Statistics in the Farey Sequence},
booktitle = {Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington,
VT, USA, June 13-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3076},
pages = {358--366},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24847-7\_27},
doi = {10.1007/978-3-540-24847-7\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ants/PatrascuP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DemaineHIP04,
author = {Erik D. Demaine and
Dion Harmon and
John Iacono and
Mihai P{u{a}}tra{c{s}}cu},
title = {Dynamic Optimality - Almost},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {484--490},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.23},
doi = {10.1109/FOCS.2004.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DemaineHIP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PaatrascuD04,
author = {Mihai P{u{a}}tra{c{s}}cu and
Erik D. Demaine},
editor = {J. Ian Munro},
title = {Tight bounds for the partial-sums problem},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {20--29},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982796},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/PaatrascuD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemaineJP04,
author = {Erik D. Demaine and
Thouis R. Jones and
Mihai P{u{a}}tra{c{s}}cu},
editor = {J. Ian Munro},
title = {Interpolation search for non-independent data},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {529--530},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982870},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DemaineJP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatrascuD04,
author = {Mihai P{u{a}}tra{c{s}}cu and
Erik D. Demaine},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Lower bounds for dynamic connectivity},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {546--553},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007435},
doi = {10.1145/1007352.1007435},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PatrascuD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-04-25 02:40 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:
