Anthony Wirth

CoRR, 2024

Online Computation of String Net Frequency.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2024

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams.

[BibT_eX]

[DOI]

Amit Chakrabarti

Andrew McGregor

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Exploiting New Properties of String Net Frequency for Efficient Computation.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Single Round-trip Hierarchical ORAM via Succinct Indices.

[BibT_eX]

[DOI]

William L. Holland

Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Maximum Coverage in Sublinear Space, Faster.

[BibT_eX]

[DOI]

Stephen Jaud

Farhana Murtaza Choudhury

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Fast Parallel Algorithms for Submodular p-Superseparable Maximization.

[BibT_eX]

[DOI]

Philip Cervenjak

Junhao Gan

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Tight Data Access Bounds for Private Top-k Selection.

[BibT_eX]

[DOI]

Farhana Murtaza Choudhury

Proceedings of the International Conference on Machine Learning, 2023

Maximum Coverage in Random-Arrival Streams.

[BibT_eX]

[DOI]

Rowan Warneke

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Walking to Hide: Privacy Amplification via Random Message Exchanges in Network.

[BibT_eX]

[DOI]

CoRR, 2022

An Almost Optimal Algorithm for Unbounded Search with Noisy Information.

[BibT_eX]

[DOI]

Junhao Gan

Xin Zhang

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data.

[BibT_eX]

[DOI]

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

Gender Bias in AI Recruitment Systems: A Sociological-and Data Science-based Case Study.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Technology and Society, 2022

Immediate Text Search on Streams Using Apoptosic Indexes.

[BibT_eX]

[DOI]

Patrick Eades

Proceedings of the Advances in Information Retrieval, 2022

Efficient Oblivious Permutation via the Waksman Network.

[BibT_eX]

[DOI]

William L. Holland

Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Locally Differentially Private Frequency Estimation.

[BibT_eX]

[DOI]

CoRR, 2021

Correlation Clustering in Data Streams.

[BibT_eX]

[DOI]

Algorithmica, 2021

Dynamic Structural Clustering on Graphs.

[BibT_eX]

[DOI]

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

2020

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Graph Clustering in All Parameter Regimes.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Recency Queries with Succinct Representation.

[BibT_eX]

[DOI]

William L. Holland

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

2019

Metric-Constrained Optimization for Graph Clustering Algorithms.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2019

Learning Resolution Parameters for Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

Result-Sensitive Binary Search with Noisy Information.

[BibT_eX]

[DOI]

Narthana S. Epa

Junhao Gan

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

A Projection Method for Metric-Constrained Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

A Correlation Clustering Framework for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Correlation Clustering Generalized.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering.

[BibT_eX]

[DOI]

CoRR, 2017

Correlation Clustering with Low-Rank Matrices.

[BibT_eX]

[DOI]

Anthony Ian Wirth

Proceedings of the 26th International Conference on World Wide Web, 2017

A Cost Model for Long-Term Compressed Data Retention.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Precedence-Constrained Min Sum Set Cover.

[BibT_eX]

[DOI]

Jessica McClintock

Julián Mestre

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Practical adaptive search trees with performance bounds.

[BibT_eX]

[DOI]

Proceedings of the Australasian Computer Science Week Multiconference, 2017

2016

Effective Construction of Relative Lempel-Ziv Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

Efficient Parallel Algorithms for k-Center Clustering.

[BibT_eX]

[DOI]

Jessica McClintock

Proceedings of the 45th International Conference on Parallel Processing, 2016

On Approximating Target Set Selection.

[BibT_eX]

[DOI]

Moses Charikar

Yonatan Naamad

Proceedings of the Approximation, 2016

2015

Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover.

[BibT_eX]

[DOI]

Amit Chakrabarti

Electron. Colloquium Comput. Complex., 2015

Access Time Tradeoffs in Archive Compression.

[BibT_eX]

[DOI]

Proceedings of the Information Retrieval Technology, 2015

2014

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Principled dictionary pruning for low-memory corpus compression.

[BibT_eX]

[DOI]

Jiancong Tong

Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

Compact Auxiliary Dictionaries for Incremental Compression of Large Repositories.

[BibT_eX]

[DOI]

Jiancong Tong

Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Using Inter-file Similarity to Improve Intra-file Compression.

[BibT_eX]

[DOI]

Angelos Molfetas

Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Storing a Collection of Differentially Compressed Files Recursively.

[BibT_eX]

[DOI]

Angelos Molfetas

Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Scalability in Recursively Stored Delta Compressed Collections of Files.

[BibT_eX]

[DOI]

Angelos Molfetas

Proceedings of the Second Australasian Web Conference, 2014

Blended Dictionaries for Reduced-Memory Lempel-Ziv Corpus Compression.

[BibT_eX]

[DOI]

Jiancong Tong

Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Graph Representations and Applications of Citation Networks.

[BibT_eX]

[DOI]

Matthias Petri

Alistair Moffat

Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Lazy and Eager Approaches for the Set Cover Problem.

[BibT_eX]

[DOI]

C. L. Lim

Alistair Moffat

Anthony Ian Wirth

Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013

Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs.

[BibT_eX]

[DOI]

Andrew Chester

Riccardo Dondi

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

2012

A theoretical approach to gene network identification.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Identification of binary gene networks.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Automatic generation of protein structure cartoons with Pro-origami.

[BibT_eX]

[DOI]

Bioinform., 2011

The query complexity of estimating weighted averages.

[BibT_eX]

[DOI]

Acta Informatica, 2011

On Optimal Arrangements of Binary Sensors.

[BibT_eX]

[DOI]

Proceedings of the Spatial Information Theory - 10th International Conference, 2011

Collection-based compression using discovered long matching strings.

[BibT_eX]

[DOI]

Andrew Peel

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Lock-free parallel dynamic programming.

[BibT_eX]

[DOI]

Alex D. Stivala

Maria Garcia de la Banda

Manuel V. Hermenegildo

J. Parallel Distributed Comput., 2010

Engineering burstsort: Toward fast in-place string sorting.

[BibT_eX]

[DOI]

Ranjan Sinha

ACM J. Exp. Algorithmics, 2010

Fast and accurate protein substructure searching with simulated annealing and GPUs.

[BibT_eX]

[DOI]

Alex D. Stivala

BMC Bioinform., 2010

A Polynomial Time Approximation Scheme for k-Consensus Clustering.

[BibT_eX]

[DOI]

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

Set cover algorithms for very large datasets.

[BibT_eX]

[DOI]

Graham Cormode

Howard J. Karloff

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

Improved consensus clustering via linear programming.

[BibT_eX]

[DOI]

Nicholas Downing

Proceedings of the Computer Science 2010, 2010

2009

Ranking tournaments: Local search and a new algorithm.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Tableau-based protein substructure search using quadratic programming.

[BibT_eX]

[DOI]

Alex D. Stivala

BMC Bioinform., 2009

2008

Engineering Burstsort: Towards Fast In-Place String Sorting.

[BibT_eX]

[DOI]

Ranjan Sinha

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Spectral clustering with inconsistent advice.

[BibT_eX]

[DOI]

James Saunderson

Proceedings of the Machine Learning, 2008

A Local-Search 2-Approximation for 2-Correlation-Clustering.

[BibT_eX]

[DOI]

James Saunderson

Proceedings of the Algorithms, 2008

Pattern discovery in motion time series via structure-based spectral clustering.

[BibT_eX]

[DOI]

Xiaozhe Wang

Liang Wang

Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008

2007

Are approximation algorithms for consensus clustering worthwhile?.

[BibT_eX]

[DOI]

Michael Bertolacci

Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

Structure-Based Statistical Features and Multivariate Time Series Clustering.

[BibT_eX]

[DOI]

Xiaozhe Wang

Liang Wang

Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006

Asymmetry in <i>k</i>-center variants.

[BibT_eX]

[DOI]

Inge Li Gørtz

Theor. Comput. Sci., 2006

New algorithms research for first year students.

[BibT_eX]

[DOI]

Michael Bertolacci

Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

2005

Clustering with qualitative information.

[BibT_eX]

[DOI]

Moses Charikar

Venkatesan Guruswami

J. Comput. Syst. Sci., 2005

2004

Maximizing Quadratic Programs: Extending Grothendieck's Inequality.

[BibT_eX]

[DOI]

Moses Charikar

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Asymmetry in k-Center Variants.

[BibT_eX]

[DOI]

Inge Li Gørtz