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