Alejandro López-Ortiz

Marc P. Renault

Adi Rosén

Theor. Comput. Sci., 2020

Interruptible algorithms for multiproblem solving.

[BibT_eX]

[DOI]

J. Sched., 2020

2019

On the Separation and Equivalence of Paging Strategies and Other Online Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Computing k-Atomicity in Polynomial Time.

[BibT_eX]

[DOI]

Wojciech M. Golab

Xiaozhou (Steve) Li

Naomi Nishimura

SIAM J. Comput., 2018

Arbitrary Overlap Constraints in Graph Packing Problems.

[BibT_eX]

[DOI]

Cynthia B. Pérez

Int. J. Found. Comput. Sci., 2018

2017

Inverted Treaps.

[BibT_eX]

[DOI]

Roberto Konow

Gonzalo Navarro

Charles L. A. Clarke

ACM Trans. Inf. Syst., 2017

The within-strip discrete unit disk cover problem.

[BibT_eX]

[DOI]

Robert Fraser

Theor. Comput. Sci., 2017

Optimal scheduling of contract algorithms with soft deadlines.

[BibT_eX]

[DOI]

J. Sched., 2017

Multi-processor Search and Scheduling Problems with Setup Cost.

[BibT_eX]

[DOI]

Diogo Arsénio

Christoph Dürr

Theory Comput. Syst., 2017

Lower Bounds for Graph Exploration Using Local Policies.

[BibT_eX]

[DOI]

Aditya Kumar Akash

Sándor P. Fekete

Seoung Kyou Lee

James McLurkin

J. Graph Algorithms Appl., 2017

The impact of processing order on performance: A taxonomy of semi-FIFO policies.

[BibT_eX]

[DOI]

Alexander V. Sirotkin

J. Comput. Syst. Sci., 2017

On the list update problem with advice.

[BibT_eX]

[DOI]

Joan Boyar

Kim S. Larsen

Inf. Comput., 2017

2016

Analyzing Cache Behaviour in Multicore Architectures.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Alternative Performance Measures in Online Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Intersections of Inverted Lists.

[BibT_eX]

[DOI]

Andrew Kane

Encyclopedia of Algorithms, 2016

Online Scheduling FIFO Policies with Admission and Push-Out.

[BibT_eX]

[DOI]

Alexander V. Sirotkin

Theory Comput. Syst., 2016

On the Advice Complexity of the k-server Problem Under Sparse Metrics.

[BibT_eX]

[DOI]

Sushmita Gupta

Theory Comput. Syst., 2016

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors.

[BibT_eX]

[DOI]

Gabriel Scalosub

Michael Segal

J. Netw. Comput. Appl., 2016

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101).

[BibT_eX]

[DOI]

Ulrich Carsten Meyer

Markus E. Nebel

Robert Sedgewick

Dagstuhl Reports, 2016

Arbitrary Overlap Constraints in Graph Packing Problems.

[BibT_eX]

[DOI]

CoRR, 2016

Online Bin Packing with Advice.

[BibT_eX]

[DOI]

Joan Boyar

Kim S. Larsen

Algorithmica, 2016

Optimal Distributed Searching in the Plane with and Without Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Recognition of Triangulation Duals of Simple Polygons With and Without Holes.

[BibT_eX]

Martin Derka

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.

[BibT_eX]

[DOI]

Henning Fernau

ACM Trans. Comput. Theory, 2015

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

[BibT_eX]

[DOI]

Diego Seco

Theory Comput. Syst., 2015

List Colouring Big Graphs On-Line.

[BibT_eX]

[DOI]

Martin Derka

CoRR, 2015

Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG).

[BibT_eX]

[DOI]

Comput. Geom., 2015

Parameterized Analysis of Paging and List Update Algorithms.

[BibT_eX]

[DOI]

Martin R. Ehmsen

Algorithmica, 2015

Kernelization Algorithms for Packing Problems Allowing Overlaps.

[BibT_eX]

[DOI]

Henning Fernau

Proceedings of the Theory and Applications of Models of Computation, 2015

Algorithms in the Ultra-Wide Word Model.

[BibT_eX]

[DOI]

Arash Farzan

Patrick K. Nicholson

Proceedings of the Theory and Applications of Models of Computation, 2015

Efficient Online Strategies for Renting Servers in the Cloud.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Computing Weak Consistency in Polynomial Time: [Extended Abstract].

[BibT_eX]

[DOI]

Wojciech M. Golab

Xiaozhou (Steve) Li

Naomi Nishimura

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

List Colouring and Partial List Colouring of Graphs On-line.

[BibT_eX]

[DOI]

Martin Derka

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

All-Around Near-Optimal Solutions for the Online Bin Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Local policies for efficiently patrolling a triangulated region by a robot swarm.

[BibT_eX]

[DOI]

James McLurkin

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Online Packing of Equilateral Triangles.

[BibT_eX]

[DOI]

Zahed Rahmati

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Multi-target ray searching problems.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Theor. Comput. Sci., 2014

The Hausdorff Core Problem on Simple Polygons.

[BibT_eX]

[DOI]

Matthew Skala

J. Comput. Geom., 2014

Parameterized Algorithms for the H-Packing with t-Overlap Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms.

[BibT_eX]

[DOI]

Robert Suderman

Int. J. Netw. Comput., 2014

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091).

[BibT_eX]

[DOI]

Ulrich Carsten Meyer

Robert Sedgewick

Dagstuhl Reports, 2014

Optimal Strategies for Search and Rescue Operations with Robot Swarms.

[BibT_eX]

[DOI]

CoRR, 2014

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem.

[BibT_eX]

[DOI]

CoRR, 2014

The ${\mathcal{G}}$ -Packing with t-Overlap Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

On the online fault-tolerant server consolidation problem.

[BibT_eX]

[DOI]

Khuzaima Daudjee

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Better Compression through Better List Update Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

A Parameterized Algorithm for Packing Overlapping Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2014

Balancing work and size with bounded buffers.

[BibT_eX]

[DOI]

Gabriel Scalosub

Michael Segal

Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

Almost Online Square Packing.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Multi-Pivot Quicksort: Theory and Experiments.

[BibT_eX]

[DOI]

Shrinu Kushagra

Aurick Qiao

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

A novel approach for leveraging co-occurrence to improve the false positive error in signature files.

[BibT_eX]

[DOI]

Pedram Ghodsnia

Kamran Tirdad

J. Discrete Algorithms, 2013

Broadcasting in Conflict-Aware Multi-channel Networks.

[BibT_eX]

[DOI]

Francisco Claude

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

On the Sublinear Processor Gap for Parallel Architectures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Faster and smaller inverted indices with treaps.

[BibT_eX]

[DOI]

Roberto Konow

Gonzalo Navarro

Charles L. A. Clarke

Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

Orthogonal query recommendation.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

The Distance 4-Sector of Two Points Is Unique.

[BibT_eX]

[DOI]

Robert Fraser

Meng He

Akitoshi Kawamura

Patrick K. Nicholson

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Efficient demand assignment in multi-connected microgrids with a shared central grid.

[BibT_eX]

[DOI]

Proceedings of the Sustainable Internet and ICT for Sustainability, 2013

Efficient demand assignment in multi-connected microgrids.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Future Energy Systems, 2013

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models.

[BibT_eX]

[DOI]

Susana Ladra

Diego Seco

Proceedings of the 2013 Data Compression Conference, 2013

Multi-queued network processors for packets with heterogeneous processing requirements.

[BibT_eX]

[DOI]

Alexander Sirotkin

Proceedings of the Fifth International Conference on Communication Systems and Networks, 2013

A Survey of Algorithms and Models for List Update.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

Optimal strategies for the list update problem under the MRM alternative cost model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

List update with probabilistic locality of reference.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

On the discrete Unit Disk Cover Problem.

[BibT_eX]

[DOI]

Gautam K. Das

Robert Fraser

Bradford G. Nickerson

Int. J. Comput. Geom. Appl., 2012

Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors

[BibT_eX]

[DOI]

Gabriel Scalosub

Michael Segal

CoRR, 2012

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).

[BibT_eX]

[DOI]

Algorithmica, 2012

Minimizing Cache Usage in Paging.

[BibT_eX]

[DOI]

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

FIFO Queueing Policies for Packets with Heterogeneous Processing.

[BibT_eX]

[DOI]

Alexander Sirotkin

Denis Tugaryov

Proceedings of the Design and Analysis of Algorithms, 2012

A taxonomy of Semi-FIFO policies.

[BibT_eX]

[DOI]

Alexander Sirotkin

Proceedings of the 31st IEEE International Performance Computing and Communications Conference, 2012

Paging for multi-core shared caches.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

REWIRE: An optimization-based framework for unstructured data center network design.

[BibT_eX]

[DOI]

Andrew R. Curtis

Tommy Carpenter

Mustafa Elsheikh

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 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

Untangled monotonic chains and adaptive range search.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Orthogonal Query Expansion

[BibT_eX]

[DOI]

Margareta Ackerman

David Loker

CoRR, 2011

Efficient view point selection for silhouettes of convex polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2011

The Cost of Cache-Oblivious Searching.

[BibT_eX]

[DOI]

Michael A. Bender

Gerth Stølting Brodal

Algorithmica, 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

A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

COCA Filters: Co-occurrence Aware Bloom Filters.

[BibT_eX]

[DOI]

Kamran Tirdad

Pedram Ghodsnia

Proceedings of the String Processing and Information Retrieval, 2011

Brief announcement: paging for multicore processors.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010

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

[BibT_eX]

[DOI]

Bradford G. Nickerson

Discret. Math. Algorithms Appl., 2010

Sorting with networks of data structures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Some New Equiprojective Polyhedra

[BibT_eX]

[DOI]

Mohammad Monoar Hossain

Sabrina Nusrat

Saad Altaful Quader

Nabila Rahman

CoRR, 2010

LEGUP: using heterogeneity to reduce the cost of data center network upgrades.

[BibT_eX]

[DOI]

Andrew R. Curtis

Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology, 2010

2009

On the relative dominance of paging algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

SIGACT News, 2009

An experimental investigation of set intersection algorithms for text searching.

[BibT_eX]

[DOI]

Tyler Lu

ACM J. Exp. Algorithmics, 2009

An Application of Self-organizing Data Structures to Compression.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 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

Efficient Algorithms for Context Query Evaluation over a Tagged Corpus.

[BibT_eX]

[DOI]

Alex López-Ortiz

Proceedings of the 2009 International Conference of the Chilean Computer Science Society, 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

Online Sorted Range Reporting.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Rolf Fagerberg

Mark Greve

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

Capacity Provisioning a Valiant Load-Balanced Network.

[BibT_eX]

[DOI]

Andrew R. Curtis

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Interruptible Algorithms for Multi-Problem Solving.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Rolf Niedermeier

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Rolf Niedermeier

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 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]

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]

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

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Valiant Load Balancing, Benes Networks and Resilient Backbone Design.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

Foreword.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Faster Adaptive Set Intersections for Text Searching.

[BibT_eX]

[DOI]

Tyler Lu

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

06421 Abstracts Collection -- Robot Navigation.

[BibT_eX]

[DOI]

Sándor P. Fekete

Rudolf Fleischer

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

06421 Executive Summary -- Robot Navigation.

[BibT_eX]

[DOI]

Sándor P. Fekete

Rudolf Fleischer

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

Adaptive Analysis of On-line Algorithms.

[BibT_eX]

[DOI]

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

A Quadratic Propagator for the Inter-Distance Constraint.

[BibT_eX]

[DOI]

Gilles Pesant

Proceedings of the Proceedings, 2006

Optimal Scheduling of Contract Algorithms for Anytime Problems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Algorithmic foundations of the internet.

[BibT_eX]

[DOI]

SIGACT News, 2005

A Survey of Performance Measures for On-line Algorithms

[BibT_eX]

[DOI]

SIGACT News, 2005

Fast string sorting using order-preserving compression.

[BibT_eX]

[DOI]

Mehdi Mirzazadeh

Mohammad Ali Safari

M. Hossein Sheikh Attar

ACM J. Exp. Algorithmics, 2005

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.

[BibT_eX]

[DOI]

Constraints An Int. J., 2005

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.

[BibT_eX]

[DOI]

Brona Brejová

Daniel G. Brown

Ian M. Harrower

Tomás Vinar

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

From Linear Relaxations to Global Constraint Propagation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

Cross-Stitching Using Little Thread.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Finding hidden independent sets in interval graphs.

[BibT_eX]

[DOI]

Tomás Vinar

Theor. Comput. Sci., 2004

Longest increasing subsequences in sliding windows.

[BibT_eX]

[DOI]

Michael H. Albert

S. Srinivasa Rao

Mohammad Ali Safari

Theor. Comput. Sci., 2004

Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies.

[BibT_eX]

[DOI]

Lukasz Golab

David DeHaan

Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Improved Algorithms for the Global Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

Algorithmic Foundations of the Internet: Roundup.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Search Engines and Web Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Algorithmic Foundations of the Internet: Foreword.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

On universally easy classes for NP-complete problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A linear lower bound on index size for text retrieval.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Drawing K2, n: A lower bound.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Searching and on-line recognition of star-shaped polygons.

[BibT_eX]

[DOI]

Inf. Comput., 2003

On the number of distributed measurement points for network tomography.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Identifying frequent items in sliding windows over on-line packet streams.

[BibT_eX]

[DOI]

Lukasz Golab

David DeHaan

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint.

[BibT_eX]

[DOI]

John Tromp

Proceedings of the IJCAI-03, 2003

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.

[BibT_eX]

[DOI]

Guillaume Poirier

Proceedings of the Algorithms, 2003

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.

[BibT_eX]

[DOI]

Sayyed Bashir Sadjad

Proceedings of the Principles and Practice of Constraint Programming, 2003

the asteroid surveying problem and other puzzles.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Curves of width one and the river shore problem.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Online Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Pat Morin

Int. J. Comput. Geom. Appl., 2002

Online Parallel Heuristics and Robot Searching under the Competitive Framework.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Robot Localization without Depth Perception.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Frequency Estimation of Internet Packet Streams with Limited Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Searching for the center of a circle.

[BibT_eX]

[DOI]

Tomás Vinar

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Drawing k2, n: A lower bound.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

The ultimate strategy to search on m rays?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Lower Bounds for Streets and Generalized Streets.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Parallel searching on a lattice.

[BibT_eX]

[DOI]

Graeme Sweet

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Experiments on Adaptive Set Intersections for Text Retrieval Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Adaptive set intersections, unions, and differences.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A New Lower Bound for Kernel Searching.

[BibT_eX]

[DOI]

Peter Anderson

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Position-Independent Street Searching.

[BibT_eX]

[DOI]

Christoph A. Bröcker

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

The exact cost of exploring streets with a cab.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Walking Streets Faster.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Generalized Streets Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

1995

Going Home Through an Unknown Street.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Linear pattern matching of repeated substrings.

[BibT_eX]

[DOI]

SIGACT News, 1994

New Lower Bounds for Element Distinctness on a On-Tape Turing Machine.

[BibT_eX]

[DOI]