Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 2 · newest first

  1. Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamicsCombinatorics Probability Computing · 2024
  2. A Generalized Method for Proving Polynomial Calculus Degree Lower BoundsJournal of the ACM · 2024
  3. Liveness and latency of Byzantine state-machine replicationDistributed Computing · 2024
  4. Fulgor: a fast and compact k-mer index for large-scale matching and color queriesAlgorithms for Molecular Biology · 2024
  5. Truthful Matching with Online Items and Offline AgentsAlgorithmica · 2024
  6. Inscribing or Circumscribing a Histogon to a Convex PolygonLeibniz international proceedings in informatics · 2024
  7. Total NP Search Problems with Abundant SolutionsLeibniz international proceedings in informatics · 2024
  8. A Technique for Hardness Amplification Against AC⁰Leibniz international proceedings in informatics · 2024
  9. Solving the Optimal Experiment Design Problem with Mixed-Integer Convex MethodsLeibniz international proceedings in informatics · 2023
  10. Composition Schemes: q-Enumerations and Phase Transitions in Gibbs ModelsLeibniz international proceedings in informatics · 2023
  11. CWEFT: CWE-Aware Evaluation of Free-Text vs. Typed PromptsLeibniz international proceedings in informatics · 2023
  12. Simple and Optimal Online Contention Resolution Schemes for k-Uniform MatroidsLeibniz international proceedings in informatics · 2023
  13. Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint OptimizationJournal of Artificial Intelligence Research · 2023
  14. An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max CutLeibniz international proceedings in informatics · 2023
  15. Fréchet Distance for Uncertain CurvesLeibniz international proceedings in informatics · 2023
  16. Space characterizations of complexity measures and size-space trade-offs in propositional proof systemsJournal of Computer and System Sciences · 2023
  17. Quantum Time–Space Tradeoff for Finding Multiple Collision PairsLeibniz international proceedings in informatics · 2023
  18. Sorting by prefix block-interchangesLeibniz international proceedings in informatics · 2023
  19. Complexity of verification in self-assembly with prebuilt assembliesJournal of Computer and System Sciences · 2023
  20. Conditional Dichotomy of Boolean Ordered Promise CSPsTheoretiCS · 2023
  21. Gene orthology inference via large-scale rearrangements for partially assembled genomesLeibniz international proceedings in informatics · 2023
  22. Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic InferenceLeibniz international proceedings in informatics · 2023
  23. Fully-Adaptive Dynamic Connectivity of Square Intersection GraphsLeibniz international proceedings in informatics · 2023
  24. Triangle Counting with Local Edge Differential PrivacyLeibniz international proceedings in informatics · 2023
  25. DeFi Lending During The MergeLeibniz international proceedings in informatics · 2023
  26. The Ethics of AI-Generated Maps: A Study of DALLE 2 and Implications for CartographyLeibniz international proceedings in informatics · 2023
  27. Understanding Place Identity with Generative AILeibniz international proceedings in informatics · 2023
  28. Online Coalition Formation Under Random Arrival or Coalition DissolutionLeibniz international proceedings in informatics · 2023
  29. Multilevel Skeletonization Using Local SeparatorsLeibniz international proceedings in informatics · 2023
  30. Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Experience Paper)Leibniz international proceedings in informatics · 2023
  31. Durable Algorithms for Writable LL/SC and CAS with Dynamic JoiningLeibniz international proceedings in informatics · 2023
  32. Depth-3 Circuits for Inner ProductLeibniz international proceedings in informatics · 2023
  33. Constructing Concise Convex Covers via Clique CoversLeibniz international proceedings in informatics · 2023
  34. Criticality of AC⁰ formulaeLeibniz international proceedings in informatics · 2022
  35. A Univalent Formalization of Constructive Affine SchemesLeibniz international proceedings in informatics · 2022
  36. Dynamic data structures for k-nearest neighbor queriesComputational Geometry · 2022
  37. Qafny: A Quantum-Program VerifierLeibniz international proceedings in informatics · 2022
  38. Quantum PseudoentanglementLeibniz international proceedings in informatics · 2022
  39. When Is Spring Coming? A Security Analysis of Avalanche ConsensusLeibniz international proceedings in informatics · 2022
  40. A robust class of linear recurrence sequencesLeibniz international proceedings in informatics · 2022
  41. A Unifying Framework for Online Optimization with Long-Term ConstraintsLeibniz international proceedings in informatics · 2022
  42. Programming and training rate-independent chemical reaction networksProceedings of the National Academy of Sciences · 2022
  43. Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum ComputationLeibniz international proceedings in informatics · 2022
  44. Observation and Distinction: Representing Information in Infinite GamesTheory of Computing Systems · 2022
  45. Asynchronous reconfiguration with Byzantine failuresDistributed Computing · 2022
  46. Database Theory in Action: Search-Based Program OptimizationLeibniz international proceedings in informatics · 2022
  47. Multi-modal Sensor Fusion for Auto Driving Perception: A SurveyLeibniz international proceedings in informatics · 2022
  48. Singletons for simpletons revisiting windowed backoff with Chernoff boundsLeibniz international proceedings in informatics · 2022
  49. Faster Minimization of Tardy Processing Time on a Single MachineAlgorithmica · 2022
  50. Multistage knapsackJournal of Computer and System Sciences · 2022