Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 4 · newest first

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