Document Open Access Logo

LIPIcs, Volume 274, ESA 2023, Complete Volume

Authors Inge Li Gørtz , Martin Farach-Colton , Simon J. Puglisi , Grzegorz Herman



PDF
Thumbnail PDF

File

LIPIcs.ESA.2023.pdf
  • Filesize: 38.86 MB
  • 1700 pages

Document Identifiers

Author Details

Inge Li Gørtz
  • Technical University of Denmark, Lyngby, Denmark
Martin Farach-Colton
  • Rutgers University, New Brunswick, NJ, USA
Simon J. Puglisi
  • University of Helsinki, Finland
Grzegorz Herman
  • Jagiellonian University, Kraków, Poland

Cite AsGet BibTex

31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 1-1700, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ESA.2023

Abstract

LIPIcs, Volume 274, ESA 2023, Complete Volume

Subject Classification

ACM Subject Classification
  • Computing methodologies → Machine learning
  • Information systems → Point lookups
  • Mathematics of computing → Algebraic topology
  • Mathematics of computing → Approximation algorithms
  • Mathematics of computing → Combinatorial algorithms
  • Mathematics of computing → Combinatoric problems
  • Mathematics of computing → Computations on matrices
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Graph enumeration
  • Mathematics of computing → Graphs and surfaces
  • Mathematics of computing → Graph theory
  • Mathematics of computing → Matchings and factors
  • Mathematics of computing → Paths and connectivity problems
  • Mathematics of computing → Random graphs
  • Mathematics of computing → Stochastic processes
  • Social and professional topics → Social engineering attacks
  • Theory of computation → Quantum computation theory
  • Theory of computation → Algorithm design techniques
  • Theory of computation → Algorithmic game theory
  • Theory of computation → Approximation algorithms analysis
  • Theory of computation → Complexity theory and logic
  • Theory of computation → Computational complexity and cryptography
  • Theory of computation → Computational geometry
  • Theory of computation → Database query processing and optimization (theory)
  • Theory of computation → Data compression
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Dynamic graph algorithms
  • Theory of computation → Facility location and clustering
  • Theory of computation → Finite Model Theory
  • Theory of computation → Fixed parameter tractability
  • Theory of computation → Generating random combinatorial structures
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Logic and verification
  • Theory of computation → Markov decision processes
  • Theory of computation → Massively parallel algorithms
  • Theory of computation → Mathematical optimization
  • Theory of computation → Mixed discrete-continuous optimization
  • Theory of computation → Nonconvex optimization
  • Theory of computation → Online algorithms
  • Theory of computation → Oracles and decision trees
  • Theory of computation → Packing and covering problems
  • Theory of computation → Parallel algorithms
  • Theory of computation → Parallel computing models
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Pattern matching
  • Theory of computation → Problems, reductions and completeness
  • Theory of computation → Quantum query complexity
  • Theory of computation → Randomness, geometry and discrete structures
  • Theory of computation → Random network models
  • Theory of computation → Random order and robust communication complexity
  • Theory of computation → Random projections and metric embeddings
  • Theory of computation → Scheduling algorithms
  • Theory of computation → Semidefinite programming
  • Theory of computation → Shortest paths
  • Theory of computation → Sketching and sampling
  • Theory of computation → Sorting and searching
  • Theory of computation → Sparsification and spanners
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Theory and algorithms for application domains
  • Theory of computation → Unsupervised learning and clustering
Keywords
  • LIPIcs, Volume 274, ESA 2023, Complete Volume

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail