default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIoana O. Bercea
Person information
- affiliation: KTH Royal Institute of Technology, Stockholm, Sweden
- affiliation (former): Tel-Aviv University, Israel
- affiliation (former): University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Niv Dayan, Ioana Oriana Bercea, Rasmus Pagh:
Aleph Filter: To Infinity in Constant Time. Proc. VLDB Endow. 17(11): 3644-3656 (2024)- [c11]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA 2024: 5:1-5:15 - [c10]Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh:
Daisy Bloom Filters. SWAT 2024: 9:1-9:19 - [i13]Niv Dayan, Ioana O. Bercea, Rasmus Pagh:
Aleph Filter: To Infinity in Constant Time. CoRR abs/2404.04703 (2024) - [i12]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR abs/2406.19257 (2024) - [i11]Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan:
On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do? CoRR abs/2408.03465 (2024) - 2023
- [j4]Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. Algorithmica 85(6): 1786-1804 (2023) - [j3]Niv Dayan
, Ioana O. Bercea, Pedro Reviriego, Rasmus Pagh:
InfiniFilter: Expanding Filters to Infinity and Beyond. Proc. ACM Manag. Data 1(2): 140:1-140:27 (2023) - [c9]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. FOCS 2023: 1440-1470 - [i10]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. CoRR abs/2308.14134 (2023) - 2022
- [c8]Ioana Oriana Bercea, Guy Even:
An extendable data structure for incremental stable perfect hashing. STOC 2022: 1298-1310 - [i9]Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh:
Daisy Bloom Filters. CoRR abs/2205.14894 (2022) - 2021
- [j2]Ioana O. Bercea, Guy Even:
Upper tail analysis of bucket sort and random tries. Theor. Comput. Sci. 895: 55-67 (2021) - [c7]Ioana O. Bercea, Guy Even:
Upper Tail Analysis of Bucket Sort and Random Tries. CIAC 2021: 116-129 - [c6]Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. WADS 2021: 144-157 - 2020
- [c5]Ioana O. Bercea, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. SWAT 2020: 11:1-11:17 - [i8]Ioana Oriana Bercea, Guy Even:
Upper Tail Analysis of Bucket Sort and Random Tries. CoRR abs/2002.10499 (2020) - [i7]Ioana Oriana Bercea, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. CoRR abs/2005.01098 (2020) - [i6]Ioana Oriana Bercea, Guy Even:
A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations. CoRR abs/2005.02143 (2020)
2010 – 2019
- 2019
- [c4]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM 2019: 18:1-18:22 - [i5]Ioana Oriana Bercea, Guy Even:
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. CoRR abs/1911.05060 (2019) - 2018
- [c3]Ioana Oriana Bercea:
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks. CCCG 2018: 129-141 - [i4]Ioana Oriana Bercea:
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks. CoRR abs/1809.07159 (2018) - [i3]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018) - 2016
- [j1]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. 3(1): 5:1-5:13 (2016) - [c2]Ioana Oriana Bercea, Volkan Isler, Samir Khuller:
Minimizing Uncertainty through Sensor Placement with Angle Constraints. CCCG 2016: 287-294 - [i2]Ioana Oriana Bercea, Volkan Isler, Samir Khuller:
Minimizing Uncertainty through Sensor Placement with Angle Constraints. CoRR abs/1607.05791 (2016) - 2014
- [c1]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On computing maximal independent sets of hypergraphs in parallel. SPAA 2014: 42-50 - [i1]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On Computing Maximal Independent Sets of Hypergraphs in Parallel. CoRR abs/1405.1133 (2014)
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 22:17 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:
