default search action
Reza Dorrigiv
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j10]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. Algorithmica 81(3): 1152-1179 (2019) - 2017
- [c21]Juan A. Colmenares, Reza Dorrigiv, Daniel G. Waddington:
A single-node datastore for high-velocity multidimensional sensor data. IEEE BigData 2017: 445-452 - [i3]Juan A. Colmenares, Reza Dorrigiv, Daniel G. Waddington:
Ingestion, Indexing and Retrieval of High-Velocity Multidimensional Sensor Data on a Single Node. CoRR abs/1707.00825 (2017) - 2015
- [j9]Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. Algorithmica 71(2): 330-353 (2015) - [j8]Reza Dorrigiv, Robert Fraser, Meng He
, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56(1): 220-250 (2015) - 2014
- [j7]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5(1): 14-40 (2014) - 2013
- [c20]Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco
Broadcasting in Conflict-Aware Multi-channel Networks. WALCOM 2013: 158-169 - 2012
- [j6]Reza Dorrigiv, Alejandro López-Ortiz:
List update with probabilistic locality of reference. Inf. Process. Lett. 112(13): 540-543 (2012) - [c19]Reza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik:
Optimal Average Case Strategy for Looking Around a Corner. CCCG 2012: 277-282 - [c18]Reza Dorrigiv, Meng He
On the Advice Complexity of Buffer Management. ISAAC 2012: 136-145 - [c17]Reza Dorrigiv, Robert Fraser, Meng He
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA 2012: 93-106 - 2011
- [j5]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c16]Reza Dorrigiv, Alejandro López-Ortiz:
A New Perspective on List Update: Probabilistic Locality and Working Set. WAOA 2011: 150-163 - 2010
- [b1]Reza Dorrigiv:
Alternative Measures for the Analysis of Online Algorithms. University of Waterloo, Ontario, Canada, 2010 - [j4]Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, Alejandro Salinger:
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. Discret. Math. Algorithms Appl. 2(1): 77-88 (2010)
2000 – 2009
- 2009
- [j3]Reza Dorrigiv, Alejandro López-Ortiz:
On Developing New Models, with Paging as a Case Study. SIGACT News 40(4): 98-123 (2009) - [j2]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
On the relative dominance of paging algorithms. Theor. Comput. Sci. 410(38-40): 3694-3701 (2009) - [c15]Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger:
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. ISAAC 2009: 45-54 - [c14]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He
Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212 - [c13]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-229 - [c12]Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. WAOA 2009: 104-115 - [c11]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148 - 2008
- [c10]Reza Dorrigiv, Alejandro López-Ortiz:
Adaptive Searching in One and Two Dimensions. CCCG 2008 - [c9]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
List Update Algorithms for Data Compression. DCC 2008: 512 - [c8]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
List Update with Locality of Reference. LATIN 2008: 399-410 - [c7]Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger:
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). SPAA 2008: 185-187 - [c6]Reza Dorrigiv, Alejandro López-Ortiz:
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. WALCOM 2008: 13-24 - [c5]Reza Dorrigiv, Alejandro López-Ortiz:
On Certain New Models for Paging with Locality of Reference. WALCOM 2008: 200-209 - [i2]Alejandro López-Ortiz, Reza Dorrigiv, Alejandro Salinger:
Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM). Data Structures 2008 - 2007
- [c4]Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh
On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON 2007: 459-469 - [c3]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499 - [c2]Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat:
Search Algorithms for Unstructured Peer-to-Peer Networks. LCN 2007: 343-352 - [c1]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the separation and equivalence of paging strategies. SODA 2007: 229-237 - 2006
- [i1]Reza Dorrigiv, Alejandro López-Ortiz:
Adaptive Analysis of On-line Algorithms. Robot Navigation 2006 - 2005
- [j1]Reza Dorrigiv, Alejandro López-Ortiz:
A Survey of Performance Measures for On-line Algorithms. SIGACT News 36(3): 67-81 (2005)
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 21:16 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: