Ke Yi

Proc. ACM Manag. Data, February, 2024

Reservoir Sampling over Joins.

[BibT_eX]

[DOI]

Binyang Dai

Proc. ACM Manag. Data, 2024

Continual Observation of Joins under Differential Privacy.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

Secure Query Processing with Linear Complexity.

[BibT_eX]

[DOI]

CoRR, 2024

Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy.

[BibT_eX]

[DOI]

CoRR, 2024

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024.

[BibT_eX]

[DOI]

Martin Grohe

Jan Van den Bussche

Proceedings of the Companion of the 43rd Symposium on Principles of Database Systems, 2024

Smooth Sensitivity for Geo-Privacy.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

Confidence Intervals for Private Query Processing.

[BibT_eX]

[DOI]

Dajun Sun

Proc. VLDB Endow., November, 2023

Query Evaluation under Differential Privacy.

[BibT_eX]

[DOI]

SIGMOD Rec., September, 2023

Secure Sampling for Approximate Multi-party Query Processing.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, September, 2023

R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys.

[BibT_eX]

[DOI]

Ashwin Machanavajjhala

SIGMOD Rec., 2023

Conjunctive Queries with Comparisons.

[BibT_eX]

[DOI]

Qichen Wang

SIGMOD Rec., 2023

Change Propagation Without Joins.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Better than Composition: How to Answer Multiple Relational Queries under Differential Privacy.

[BibT_eX]

[DOI]

Dajun Sun

Proc. ACM Manag. Data, 2023

Efficient Oblivious Sorting and Shuffling for Hardware Enclaves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Continual Observation under User-level Differential Privacy.

[BibT_eX]

[DOI]

Qiyao Luo

Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

SparkSQL+: Next-generation Query Planning over Spark.

[BibT_eX]

[DOI]

Binyang Dai

Qichen Wang

Proceedings of the Companion of the 2023 International Conference on Management of Data, 2023

Universal Private Estimators.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Concentrated Geo-Privacy.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Persistent Summaries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2022

Frequency Estimation Under Multiparty Differential Privacy: One-shot and Streaming.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Intersection joins under updates.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Differential Privacy on Dynamic Data.

[BibT_eX]

[DOI]

Yuan Qiu

CoRR, 2022

Query Evaluation by Circuits.

[BibT_eX]

[DOI]

Yilei Wang

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries.

[BibT_eX]

[DOI]

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Differentially Private Covariance Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Releasing Private Data for Numerical Queries.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Frequency Estimation in the Shuffle Model with Almost a Single Message.

[BibT_eX]

[DOI]

Qiyao Luo

Yilei Wang

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Shifted Inverse: A General Mechanism for Monotonic Functions under User Differential Privacy.

[BibT_eX]

[DOI]

Juanru Fang

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Cquirrel: Continuous Query Processing over Acyclic Relational Schemas.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Secure Machine Learning over Relational Data.

[BibT_eX]

[DOI]

CoRR, 2021

Secure Yannakakis: Join-Aggregate Queries over Private Data.

[BibT_eX]

[DOI]

Yilei Wang

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Residual Sensitivity for Differentially Private Multi-Way Joins.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Instance-optimal Mean Estimation Under Differential Privacy.

[BibT_eX]

[DOI]

Ziyue Huang

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Approximate Range Counting Under Differential Privacy.

[BibT_eX]

[DOI]

Ziyue Huang

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Massively Parallel Join Algorithms.

[BibT_eX]

[DOI]

SIGMOD Rec., 2020

Infnote: A Decentralized Information Sharing Platform Based on Blockchain.

[BibT_eX]

[DOI]

CoRR, 2020

Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.

[BibT_eX]

[DOI]

Algorithmica, 2020

Maintaining Acyclic Foreign-Key Joins under Updates.

[BibT_eX]

[DOI]

Qichen Wang

Proceedings of the 2020 International Conference on Management of Data, 2020

Querying Shared Data with Security Heterogeneity.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries.

[BibT_eX]

[DOI]

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Worst-Case Optimal Join Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Random Sampling and Size Estimation Over Cyclic Joins.

[BibT_eX]

[DOI]

Yu Chen

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

Output-Optimal Massively Parallel Algorithms for Similarity Joins.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2019

Technical Perspective: Online Model Management via Temporally Biased Sampling.

[BibT_eX]

[DOI]

SIGMOD Rec., 2019

Communication-Efficient Weighted Sampling and Quantile Summary for GBDT.

[BibT_eX]

[DOI]

Ziyue Huang

CoRR, 2019

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.

[BibT_eX]

[DOI]

Algorithmica, 2019

Instance and Output Optimal Parallel Algorithms for Acyclic Joins.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Streaming HyperCube: A Massively Parallel Stream Join Algorithm.

[BibT_eX]

[DOI]

Yuan Qiu

Serafeim Papadias

Proceedings of the Advances in Database Technology, 2019

2018

Tight Space Bounds for Two-Dimensional Approximate Range Counting.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).

[BibT_eX]

[DOI]

Dagstuhl Manifestos, 2018

Random Sampling over Joins Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Management of Data, 2018

Join Algorithms: From External Memory to the BSP.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Database Theory, 2018

2017

On Improving Wireless Channel Utilization: A Collision Tolerance-Based Approach.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2017

Wander Join and XDB: Online Aggregation via Random Walks.

[BibT_eX]

[DOI]

SIGMOD Rec., 2017

The Communication Complexity of Distributed epsilon-Approximations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Processing Big Data Streams (NII Shonan Meeting 2017-7).

[BibT_eX]

[DOI]

Vladimir Braverman

David P. Woodruff

NII Shonan Meet. Rep., 2017

Two-Level Sampling for Join Size Estimation.

[BibT_eX]

[DOI]

Yu Chen

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Output-optimal Parallel Algorithms for Similarity Joins.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

TUM: Towards ubiquitous multi-device localization for cross-device interaction.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

R-Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Quantiles over data streams: experimental comparisons, new analyses, and further improvements.

[BibT_eX]

[DOI]

VLDB J., 2016

Exact and approximate flexible aggregate similarity search.

[BibT_eX]

[DOI]

VLDB J., 2016

Counting Triangles in Large Graphs by Random Sampling.

[BibT_eX]

[DOI]

Bin Wu

Zhenguo Li

IEEE Trans. Knowl. Data Eng., 2016

Nearest-Neighbor Searching Under Uncertainty II.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Research Directions for Principles of Data Management (Abridged).

[BibT_eX]

[DOI]

SIGMOD Rec., 2016

Wander Join: Online Aggregation for Joins.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

Wander Join: Online Aggregation via Random Walks.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Indoor localization via multi-modal sensing on smartphones.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2016

2015

Spatial Online Sampling and Aggregation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Persistent Data Sketching.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

STORM: Spatio-Temporal Online Reasoning and Management of Large Spatio-Temporal Data.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Piecewise linear approximation of streaming time series data with max-error guarantees.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Enhancing wifi-based localization with visual clues.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2015

2014

Indexing for summary queries: Theory and practice.

[BibT_eX]

[DOI]

Lu Wang

ACM Trans. Database Syst., 2014

Tracking the Frequency Moments at All Times.

[BibT_eX]

[DOI]

Wai Ming Tai

CoRR, 2014

Cache-Oblivious Hashing.

[BibT_eX]

[DOI]

Algorithmica, 2014

Robust set reconciliation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

Equivalence between Priority Queues and Sorting in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Mergeable summaries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2013

Efficient external memory structures for range-aggregate queries.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Optimal Tracking of Distributed Heavy Hitters and Quantiles.

[BibT_eX]

[DOI]

Algorithmica, 2013

The Space Complexity of 2-Dimensional Approximate Range Counting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Quantiles over data streams: an experimental study.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Voice over the dins: Improving wireless channel utilization with collision tolerance.

[BibT_eX]

[DOI]

Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013

Streaming Authenticated Data Structures.

[BibT_eX]

[DOI]

Charalampos Papamanthou

Elaine Shi

Roberto Tamassia

Proceedings of the Advances in Cryptology, 2013

2012

Multidimensional online tracking.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Range searching on uncertain data.

[BibT_eX]

[DOI]

Siu-Wing Cheng

ACM Trans. Algorithms, 2012

The priority R-tree.

[BibT_eX]

[DOI]

ACM SIGSPATIAL Special, 2012

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Large-Scale Distributed Computation (NII Shonan Meeting 2012-1).

[BibT_eX]

[DOI]

S. Muthukrishnan

NII Shonan Meet. Rep., 2012

Dynamic Indexability and the Optimality of B-Trees.

[BibT_eX]

[DOI]

J. ACM, 2012

Continuous sampling from distributed streams.

[BibT_eX]

[DOI]

J. ACM, 2012

2011

The World in a Nutshell: Concise Range Queries.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

Semantics of Ranking Queries for Probabilistic Data.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

Algorithms for distributed functional monitoring.

[BibT_eX]

[DOI]

S. Muthukrishnan

ACM Trans. Algorithms, 2011

Building Wavelet Histograms on Large Data in MapReduce.

[BibT_eX]

[DOI]

Jeffrey Jestes

Proc. VLDB Endow., 2011

Cooperative Incumbent System Protection MAC Protocol for Multi-channel Ad-hoc Cognitive Radio Networks.

[BibT_eX]

[DOI]

Nan Hao

Sang-Jo Yoo

KSII Trans. Internet Inf. Syst., 2011

Approximate Range Searching in External Memory.

[BibT_eX]

[DOI]

Micha Streppel

Algorithmica, 2011

Flexible aggregate similarity search.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Sampling based algorithms for quantile computation in sensor networks.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Beyond simple aggregates: indexing for summary queries.

[BibT_eX]

[DOI]

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Tracking distributed aggregates over time-based sliding windows.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Optimal sampling algorithms for frequency estimation in distributed data.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Top-k queries on temporal data.

[BibT_eX]

[DOI]

Wangchao Le

VLDB J., 2010

Sliding-window top-k queries on uncertain streams.

[BibT_eX]

[DOI]

VLDB J., 2010

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2010

I/O-efficient batched union-find and its applications to terrain analysis.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Tree Indexing on Solid State Drives.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2010

Verifying Computations with Streaming Interactive Proofs.

[BibT_eX]

[DOI]

Justin Thaler

Electron. Colloquium Comput. Complex., 2010

On the Cell Probe Complexity of Dynamic Membership.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Logging every footstep: quantile summaries for the entire history.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Probabilistic string similarity joins.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Optimal sampling from distributed streams.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Correlation hiding by independence masking.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Data Engineering, 2010

Clustering with Diversity.

[BibT_eX]

[DOI]

Jian Li

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

The hardness and approximation algorithms for l-diversity.

[BibT_eX]

[DOI]

Xiaokui Xiao

Proceedings of the EDBT 2010, 2010

2009

Small synopses for group-by query verification on outsourced data streams.

[BibT_eX]

[DOI]

Marios Hadjieleftheriou

George Kollios

Divesh Srivastava

ACM Trans. Database Syst., 2009

Optimal External Memory Planar Point Enclosure.

[BibT_eX]

[DOI]

Vasilis Samoladas

Algorithmica, 2009

Dynamic external hashing: the limit of buffering.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Multi-dimensional online tracking.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Quality and efficiency in high dimensional nearest neighbor search.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Ranking distributed probabilistic data.

[BibT_eX]

[DOI]

Jeffrey Jestes

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Indexing uncertain data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

A Concise Representation of Range Queries.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

Tree Indexing on Flash Disks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

Semantics of Ranking Queries for Probabilistic Data and Expected Ranks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

2008

R-Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2008

A dynamic data structure for top-k queries on uncertain data.

[BibT_eX]

[DOI]

Jiang Chen

Theor. Comput. Sci., 2008

The priority R-tree: A practically efficient and worst-case optimal R-tree.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Sliding-window top-k queries on uncertain streams.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries

[BibT_eX]

[DOI]

CoRR, 2008

Finding frequent items in probabilistic data.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Efficient Processing of Top-k Queries in Uncertain Databases.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

Randomized Synopses for Query Assurance on Data Streams.

[BibT_eX]

[DOI]

Marios Hadjieleftheriou

George Kollios

Divesh Srivastava

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams.

[BibT_eX]

[DOI]

Suresh Venkatasubramanian

Marios Hadjieleftheriou

George Kollios

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Restricted strip covering and the sensor cover problem.

[BibT_eX]

[DOI]

Adam L. Buchsbaum

Alon Efrat

Shaili Jain

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

Dynamic Structures for Top- k Queries on Uncertain Data.

[BibT_eX]

[DOI]

Jiang Chen

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

TerraStream: from elevation data to watershed hierarchies.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

2005

Optimal Lexicographic Shaping of Aggregate Streaming Data.

[BibT_eX]

[DOI]

Stergios V. Anastasiadis

Peter J. Varman

Jeffrey Scott Vitter

IEEE Trans. Computers, 2005

An optimal dynamic interval stabbing-max data structure?

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Data Engineering, 2005

I/O-Efficient Construction of Constrained Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Incremental Maintenance of XML Structural Indexes.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

2003

Efficient Maintenance of Materialized Top-k Views.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Data Engineering, 2003

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Lexicographically optimal smoothing for broadband traffic multiplexing.

[BibT_eX]

[DOI]

Stergios V. Anastasiadis

Peter J. Varman

Jeffrey Scott Vitter

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Experimental evaluation of a variable structure controller for constrained robots.

[BibT_eX]

[DOI]

Mohamed Zribi