← Leibniz international proceedings in informatics
Papers in Leibniz international proceedings in informatics
Page 3 · newest first
- Integrity Constraints Revisited: From Exact to Approximate ImplicationLeibniz international proceedings in informatics · 2022
- 𝓁_p-Spread and Restricted Isometry Properties of Sparse Random MatricesLeibniz international proceedings in informatics · 2022
- Nonlinear Repair Schemes of Reed-Solomon Codes.Leibniz international proceedings in informatics · 2022
- Multiparty Computation with Covert Security and Public VerifiabilityLeibniz international proceedings in informatics · 2022
- Log-Sobolev inequality for the multislice, with applicationsElectronic Journal of Probability · 2022
- Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural NetworksLeibniz international proceedings in informatics · 2022
- Galois Connecting Call-by-Value and Call-by-NameLeibniz international proceedings in informatics · 2022
- Robustness Against Read Committed for Transaction Templates with Functional ConstraintsLeibniz international proceedings in informatics · 2022
- Degree Sequence Bound For Join Cardinality EstimationLeibniz international proceedings in informatics · 2022
- Randomness Extraction from Somewhat Dependent SourcesLeibniz international proceedings in informatics · 2022
- The Space Complexity of SamplingLeibniz international proceedings in informatics · 2022
- Filling Crosswords is Very HardLeibniz international proceedings in informatics · 2022
- Industrial Challenge 2022: A High-Performance Real-Time Case Study on ArmLeibniz international proceedings in informatics · 2022
- Distributed CONGEST Approximation of Weighted Vertex Covers and MatchingsLeibniz international proceedings in informatics · 2021
- On the Download Rate of Homomorphic Secret SharingLeibniz international proceedings in informatics · 2021
- Non-Uniform k-Center and Greedy ClusteringLeibniz international proceedings in informatics · 2021
- Fully Device-Independent Quantum Key Distribution Using Synchronous CorrelationsLeibniz international proceedings in informatics · 2021
- Quantum Algorithms and Lower Bounds for Linear Regression with Norm ConstraintsLeibniz international proceedings in informatics · 2021
- Approximating LCS and Alignment Distance over Multiple SequencesLeibniz international proceedings in informatics · 2021
- Sublinear Approximation Algorithm for Nash Social Welfare with XOS ValuationsLeibniz international proceedings in informatics · 2021
- Improved Quantum Lower and Upper Bounds for Matrix ScalingLeibniz international proceedings in informatics · 2021
- Many-visits TSP revisitedJournal of Computer and System Sciences · 2021
- Distributed Vertex Cover ReconfigurationLeibniz international proceedings in informatics · 2021
- Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy TheoremLeibniz international proceedings in informatics · 2021
- Fast Succinct Retrieval and Approximate Membership Using RibbonLeibniz international proceedings in informatics · 2021
- The Complexity of Promise SAT on Non-Boolean DomainsLeibniz international proceedings in informatics · 2021
- Fractal Intersections and Products via Algorithmic DimensionLeibniz international proceedings in informatics · 2021
- Top Tree Compression of TriesLeibniz international proceedings in informatics · 2021
- Scheduling with Communication Delay in Near-Linear TimeLeibniz international proceedings in informatics · 2021
- Computing NP-Hard Repetitiveness Measures via MAX-SATLeibniz international proceedings in informatics · 2021
- Correlation Detection in Trees for Planted Graph AlignmentLeibniz international proceedings in informatics · 2021
- Sparse hop spanners for unit disk graphsLeibniz international proceedings in informatics · 2021
- Polynomial time approximation schemes for clustering in low highway dimension graphsJournal of Computer and System Sciences · 2021
- Disk compression of k-mer setsLeibniz international proceedings in informatics · 2021
- Hierarchical Consensus: Scalability Through Optimism and Weak LivenessLeibniz international proceedings in informatics · 2021
- Beating the Folklore Algorithm for Dynamic MatchingLeibniz international proceedings in informatics · 2021
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-WidthLeibniz international proceedings in informatics · 2021
- Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive CombinatoricsLeibniz international proceedings in informatics · 2021
- On Polynomial Recursive SequencesLeibniz international proceedings in informatics · 2021
- Fractal Dimension and Lower Bounds for Geometric ProblemsLeibniz international proceedings in informatics · 2021
- CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding TasksLeibniz international proceedings in informatics · 2021
- Automated Dynamic Concurrency Analysis for GoLeibniz international proceedings in informatics · 2021
- Reversible Pebble Games and the Relation Between Tree-Like and General Resolution SpaceLeibniz international proceedings in informatics · 2021
- Temporal cliques admit sparse spannersJournal of Computer and System Sciences · 2021
- Multi-shot distributed transaction commitLeibniz international proceedings in informatics · 2021
- Design and Analysis of a Logless Dynamic Reconfiguration ProtocolLeibniz international proceedings in informatics · 2021
- Good-case Latency of Byzantine Broadcast: A Complete CategorizationLeibniz international proceedings in informatics · 2021
- Almost Optimal Inapproximability of Multidimensional Packing ProblemsLeibniz international proceedings in informatics · 2021
- Resolution with Counting: Dag-Like Lower Bounds and Different ModuliLeibniz international proceedings in informatics · 2021
- Smooth and Strong PCPsLeibniz international proceedings in informatics · 2021