← Leibniz international proceedings in informatics
Papers in Leibniz international proceedings in informatics
Page 4 · newest first
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) MusketeersAlgorithmica · 2021
- Hitting Sets and Reconstruction for Dense Orbits in VPₑ and ΣΠΣ CircuitsLeibniz international proceedings in informatics · 2021
- Packing Squares into a Disk with Optimal Worst-Case DensityLeibniz international proceedings in informatics · 2021
- Locality Sensitive Hashing for Efficient Similar Polygon RetrievalLeibniz international proceedings in informatics · 2021
- Quantum Query Complexity with Matrix-Vector ProductsLeibniz international proceedings in informatics · 2021
- Dynamic Membership for Regular LanguagesLeibniz international proceedings in informatics · 2021
- Keyboards as a New Model of ComputationLeibniz international proceedings in informatics · 2021
- volesti: Volume Approximation and Sampling for Convex Polytopes in RThe R Journal · 2021
- Almost-Linear-Time Weighted 𝓁_p-Norm Solvers in Slightly Dense Graphs via SparsificationLeibniz international proceedings in informatics · 2021
- Connected k-partition of k-connected graphs and c-claw-free graphsLeibniz international proceedings in informatics · 2021
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice GraphsLeibniz international proceedings in informatics · 2021
- Enumeration Algorithms for Conjunctive Queries with ProjectionLeibniz international proceedings in informatics · 2021
- Ranked Enumeration of Conjunctive Query ResultsLeibniz international proceedings in informatics · 2021
- Incremental Edge Orientation in ForestsLeibniz international proceedings in informatics · 2021
- Distant Representatives for Rectangles in the PlaneLeibniz international proceedings in informatics · 2021
- Worst-Case Efficient Dynamic Geometric Independent SetLeibniz international proceedings in informatics · 2021
- Faster Algorithms for Longest Common SubstringLeibniz international proceedings in informatics · 2021
- An Instance-Optimal Algorithm for Bichromatic Rectangular VisibilityLeibniz international proceedings in informatics · 2021
- Constructing Initial Algebras Using Inflationary IterationLeibniz international proceedings in informatics · 2021
- The Seesaw Algorithm: Function Optimization Using Implicit Hitting SetsLeibniz international proceedings in informatics · 2021
- Replacing Probability Distributions in Security Games via Hellinger DistanceLeibniz international proceedings in informatics · 2021
- Probabilistic Analysis of Euclidean Capacitated Vehicle RoutingLeibniz international proceedings in informatics · 2021
- Online Linear Extractors for Independent SourcesLeibniz international proceedings in informatics · 2021
- Restricted Constrained Delaunay TriangulationsLeibniz international proceedings in informatics · 2021
- One-Tape Turing Machine and Branching Program Lower Bounds for MCSPLeibniz international proceedings in informatics · 2021
- Complete Problems for Multi-Pseudodeterministic ComputationsLeibniz international proceedings in informatics · 2021
- Colouring Polygon Visibility Graphs and Their GeneralizationsLeibniz international proceedings in informatics · 2021
- Verifying an HTTP Key-Value Server with Interaction Trees and VSTLeibniz international proceedings in informatics · 2021
- Exact and Approximation Algorithms for Many-To-Many Point Matching in the PlaneLeibniz international proceedings in informatics · 2021
- A Ramsey Theorem for Finite MonoidsLeibniz international proceedings in informatics · 2021
- On Classical Decidable Logics Extended with Percentage Quantifiers and ArithmeticsLeibniz international proceedings in informatics · 2021
- Optimal Spectral-Norm Approximate Minimization of Weighted Finite AutomataLeibniz international proceedings in informatics · 2021
- The Density Fingerprint of a Periodic Point SetLeibniz international proceedings in informatics · 2021
- Testing Hamiltonicity (And Other Problems) in Minor-Free GraphsLeibniz international proceedings in informatics · 2021
- A Majority Lemma for Randomised Query ComplexityElectronic colloquium on computational complexity · 2021
- Pattern Discovery in Colored StringsLeibniz international proceedings in informatics · 2020
- On Rich Points and Incidences with Restricted Sets of Lines in 3-SpaceLeibniz international proceedings in informatics · 2020
- If VNP Is Hard, Then so Are Equations for ItLeibniz international proceedings in informatics · 2020
- Geometric Algorithms for Sampling the Flux Space of Metabolic NetworksLeibniz international proceedings in informatics · 2020
- How to Sell Information Optimally: An Algorithmic StudyLeibniz international proceedings in informatics · 2020
- Harmonic Algorithms for Packing d-Dimensional Cuboids into BinsLeibniz international proceedings in informatics · 2020
- Sequential Defaulting in Financial NetworksLeibniz international proceedings in informatics · 2020
- Computing exact solutions of consensus halving and the Borsuk-Ulam theoremJournal of Computer and System Sciences · 2020
- On approximate pure Nash equilibria in weighted congestion games with polynomial latenciesJournal of Computer and System Sciences · 2020
- Online Paging with a Vanishing RegretLeibniz international proceedings in informatics · 2020
- Relative Lipschitzness in Extragradient Methods and a Direct Recipe for AccelerationLeibniz international proceedings in informatics · 2020
- The Strongish Planted Clique Hypothesis and Its ConsequencesLeibniz international proceedings in informatics · 2020
- Distributed Distance ApproximationLeibniz international proceedings in informatics · 2020
- On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime OrderLeibniz international proceedings in informatics · 2020
- Interactive Oracle Proofs of Proximity to Algebraic Geometry CodesLeibniz international proceedings in informatics · 2020