default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Moruz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115(12): 932-938 (2015)- [j5]Gerth Stølting Brodal
, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56(1): 22-40 (2015) - 2014
- [j4]Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. ACM J. Exp. Algorithmics 19(1) (2014) - 2013
- [c16]Gabriel Moruz, Andrei Negoescu:
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. ICALP (1) 2013: 757-768 - 2012
- [j3]Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold:
Resilient k-d trees: k-means in space revisited. Frontiers Comput. Sci. 6(2): 166-178 (2012) - [c15]Gabriel Moruz, Andrei Negoescu:
Outperforming LRU via competitive analysis on parametrized inputs for paging. SODA 2012: 1669-1680 - [c14]Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. SEA 2012: 320-331 - 2011
- [c13]Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA 2011: 164-175 - 2010
- [j2]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010) - [c12]Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold:
Resilient K-d Trees: K-Means in Space Revisited. ICDM 2010: 815-820
2000 – 2009
- 2009
- [c11]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
Online paging for flash memory devices. ISAAC 2009: 352-361 - [c10]Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Counting in the Presence of Memory Faults. ISAAC 2009: 842-851 - [c9]Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
On Computational Models for Flash Memory Devices. SEA 2009: 16-27 - 2008
- [j1]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12: 3.2:1-3.2:20 (2008) - 2007
- [c8]Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Optimal Resilient Dynamic Dictionaries. ESA 2007: 347-358 - [c7]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS 2007: 194-205 - [c6]Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Priority Queues Resilient to Memory Faults. WADS 2007: 127-138 - 2006
- [c5]Gerth Stølting Brodal, Gabriel Moruz:
Skewed Binary Search Trees. ESA 2006: 708-719 - 2005
- [c4]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the Adaptiveness of Quicksort. ALENEX/ANALCO 2005: 130-140 - [c3]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP 2005: 576-588 - [c2]Gerth Stølting Brodal, Gabriel Moruz:
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. WADS 2005: 385-395 - 2002
- [c1]Gabriel Ciobanu, Daniel Dumitriu, Dorin Huzum, Gabriel Moruz, Bogdan Tanasa:
Client-Server P Systems in Modeling Molecular Interaction. WMC-CdeA 2002: 203-218
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-04-25 05:59 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:
