Reza Dorrigiv

Algorithmica, 2019

2017

Ingestion, Indexing and Retrieval of High-Velocity Multidimensional Sensor Data on a Single Node.

[BibT_eX]

[DOI]

Juan A. Colmenares

Daniel G. Waddington

CoRR, 2017

A single-node datastore for high-velocity multidimensional sensor data.

[BibT_eX]

[DOI]

Juan A. Colmenares

Daniel G. Waddington

Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2014

The Hausdorff Core Problem on Simple Polygons.

[BibT_eX]

[DOI]

Matthew Skala

J. Comput. Geom., 2014

2013

Broadcasting in Conflict-Aware Multi-channel Networks.

[BibT_eX]

[DOI]

Francisco Claude

Shahin Kamali

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

List update with probabilistic locality of reference.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods.

[BibT_eX]

[DOI]

Diego Seco

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

On the Advice Complexity of Buffer Management.

[BibT_eX]

[DOI]

Meng He

Norbert Zeh

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Optimal Average Case Strategy for Looking Around a Corner.

[BibT_eX]

[DOI]

Selim Tawfik

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

A New Perspective on List Update: Probabilistic Locality and Working Set.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010

Alternative Measures for the Analysis of Online Algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2010

An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.

[BibT_eX]

[DOI]

Bradford G. Nickerson

Discret. Math. Algorithms Appl., 2010

2009

On Developing New Models, with Paging as a Case Study.

[BibT_eX]

[DOI]

SIGACT News, 2009

An Application of Self-organizing Data Structures to Compression.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Parameterized Analysis of Paging and List Update Algorithms.

[BibT_eX]

[DOI]

Martin R. Ehmsen

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.

[BibT_eX]

[DOI]

Matthew Skala

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Untangled Monotonic Chains and Adaptive Range Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On Certain New Models for Paging with Locality of Reference.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM).

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

List Update with Locality of Reference.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

List Update Algorithms for Data Compression.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Adaptive Searching in One and Two Dimensions.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

On the separation and equivalence of paging strategies.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Search Algorithms for Unstructured Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Pawel Pralat

Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

On the Relative Dominance of Paging Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On the Complexity of Finding an Unknown Cut Via Vertex Queries.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Adaptive Analysis of On-line Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

2005

A Survey of Performance Measures for On-line Algorithms

[BibT_eX]

[DOI]