Leibniz International Proceedings in Informatics, Lipics
-
Publication Venue For
- Dynamic enumeration of similarity joins. 198. 2021
- Clustering under perturbation stability in near-linear time. 182. 2020
- Dynamic geometric set cover and hitting set. 164. 2020
- Improved dynamic geodesic nearest neighbor searching in a simple polygon. 99:41-414. 2018
- Approximating dynamic time warping and edit distance for a pair of point sequences. 51:6.1-6.16. 2016
- Maintaining Contour Trees of Dynamic Terrains. 34:796-811. 2015
- Robust algorithms for TSP and steiner tree. 168. 2020
- Online Paging with Heterogeneous Cache Slots 2023
- Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption 2023
- Online Learning and Bandits with Queried Hints 2023
- Symmetric Formulas for Products of Permutations 2023
- Multi-Robot Motion Planning for Unit Discs with Revolving Areas 2022
- On Reverse Shortest Paths in Geometric Proximity Graphs 2022
- An Improved ϵ-Approximation Algorithm for Geometric Bipartite Matching 2022
- Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications 2022
- From Geometry to Topology: Inverse Theorems for Distributed Persistence 2022
- Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems 2022
- Optimal Good-Case Latency for Rotating Leader Synchronous BFT 2022
- Brief announcement: Communication-efficient BFT using small trusted hardware to tolerate minority corruption 2021
- An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D 2021
- Differentially oblivious database joins: Overcoming the worst-case curse of fully oblivious algorithms 2021
- Perfectly oblivious (parallel) RAM revisited, and improved constructions 2021
- Sparsification of directed graphs via cut balance 2021
- Universal algorithms for clustering problems 2021
- Shrinkage of decision lists and DNF formulas 2021
- Reachability for updatable timed automata made faster and more effective 2020
- Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency 2020
- Improved extension protocols for byzantine broadcast and agreement 2020
- Online algorithms for weighted paging with predictions 2020
- Online two-dimensional load balancing 2020
- Criticality of regular formulas 2019
- Retracting graphs to cycles 2019
- An efficient algorithm for generalized polynomial partitioning and its applications 2019
- Efficient algorithms for geometric partial matching 2019
- Maintaining the union of unit discs under insertions with near-optimal overhead 2019
- Approximate minimum-weight matching with outliers under translation 2018
- Reachability in timed automata with diagonal constraints 2018
- Union of hypercubes and 3D minkowski sums with random sizes 2018
- Computing shortest paths in the plane with removable obstacles 2018
- Solida: A blockchain protocol based on reconfigurable Byzantine consensus 2018
- Maintaining reeb graphs of triangulated 2-manifolds 2018
- An improved homomorphism preservation theorem from lower bounds in circuit complexity 2017
- Brief announcement: Practical synchronous byzantine consensus 2017
- Approximate nearest neighbor search amid higher-dimensional flats 2017
- Profit sharing and efficiency in utility games 2017
- Efficient algorithms for k-regret minimizing sets 2017
- Symmetric interdiction for matching problems 2017
- Separation of AC0 [⊕] formulas and circuits 2017
- Subspace-invariant AC0 formulas 2017
- Faster algorithms for the geometric transportation problem 2017
- An efficient algorithm for placing electric vehicle charging stations 2016
- Competitive analysis of constrained queueing systems 2016
- Geometric models for musical audio data 2016
- Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms 2015
- Correlation bounds against monotone NC1 2015
- Online set cover with set requests 2014