← Leibniz international proceedings in informatics
Papers in Leibniz international proceedings in informatics
Page 6 · newest first
- Convex Hulls of Random Order TypesLeibniz international proceedings in informatics · 2020
- Making Byzantine Consensus LiveLeibniz international proceedings in informatics · 2020
- Minimum Neighboring Degree Realization in Graphs and TreesLeibniz international proceedings in informatics · 2020
- A Simple Parallel Algorithm for Natural Joins on Binary RelationsLeibniz international proceedings in informatics · 2020
- CPU Energy-Aware Parallel Real-Time SchedulingLeibniz international proceedings in informatics · 2020
- Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse GraphsLeibniz international proceedings in informatics · 2020
- Fast Algorithms for Geometric ConsensusesLeibniz international proceedings in informatics · 2020
- Data Consistency in Transactional Storage Systems: A Centralised SemanticsLeibniz international proceedings in informatics · 2020
- Owicki-Gries Reasoning for C11 RARLeibniz international proceedings in informatics · 2020
- The Topology of Local Computing in NetworksLeibniz international proceedings in informatics · 2020
- Local Conflict Coloring Revisited: Linial for ListsLeibniz international proceedings in informatics · 2020
- Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of UsersLeibniz international proceedings in informatics · 2020
- An Optimal Algorithm for Online Multiple KnapsackLeibniz international proceedings in informatics · 2020
- An Approximation Algorithm for the MAX-2-Local Hamiltonian ProblemLeibniz international proceedings in informatics · 2020
- Phyolin: Identifying a Linear Perfect Phylogeny in Single-Cell DNA Sequencing Data of TumorsLeibniz international proceedings in informatics · 2020
- Genomic Problems Involving Copy Number Profiles: Complexity and AlgorithmsLeibniz international proceedings in informatics · 2020
- Supercritical Space-Width Trade-offs for ResolutionLeibniz international proceedings in informatics · 2020
- Efficient Enumerations for Minimal Multicuts and Multiway CutsLeibniz international proceedings in informatics · 2020
- Decidability and Synthesis of Abstract Inductive InvariantsLeibniz international proceedings in informatics · 2020
- Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed StorageLeibniz international proceedings in informatics · 2020
- DAWGs for Parameterized Matching: Online Construction and Related Indexing StructuresLeibniz international proceedings in informatics · 2020
- Random Sampling and Size Estimation Over Cyclic JoinsLeibniz international proceedings in informatics · 2020
- Putting Randomized Compiler Testing into Production (Experience Report)Leibniz international proceedings in informatics · 2020
- GPU-Accelerated Computation of Vietoris-Rips Persistence BarcodesLeibniz international proceedings in informatics · 2020
- Demystifying the Real-Time Linux Scheduling LatencyLeibniz international proceedings in informatics · 2020
- Approximate Search for Known Gene Clusters in New Genomes Using PQ-TreesLeibniz international proceedings in informatics · 2020
- Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator ConstructionsLeibniz international proceedings in informatics · 2020
- Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)Leibniz international proceedings in informatics · 2020
- Spiking Neural Networks Through the Lens of Streaming AlgorithmsLeibniz international proceedings in informatics · 2020
- The Adversarial Stackelberg Value in Quantitative GamesLeibniz international proceedings in informatics · 2020
- Near-Optimal Complexity Bounds for Fragments of the Skolem ProblemLeibniz international proceedings in informatics · 2020
- What You Must Remember When Transforming DatawordsLeibniz international proceedings in informatics · 2020
- LSTM-TrajGAN: A Deep Learning Approach to Trajectory Privacy ProtectionLeibniz international proceedings in informatics · 2020
- U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem RevisitedLeibniz international proceedings in informatics · 2020
- Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHPLeibniz international proceedings in informatics · 2020
- Lower Bounds for Semi-adaptive Data Structures via CorruptionLeibniz international proceedings in informatics · 2020
- The Power of Synergy in Differential Privacy: Combining a Small Curator with Local RandomizersLeibniz international proceedings in informatics · 2019
- Pricing Multi-Unit MarketsLeibniz international proceedings in informatics · 2019
- FL-RMQ: A Learned Approach to Range Minimum QueriesLeibniz international proceedings in informatics · 2019
- Classification of Distributed Binary Labeling ProblemsLeibniz international proceedings in informatics · 2019
- Optimal Streaming Algorithms for Submodular Maximization with Cardinality ConstraintsLeibniz international proceedings in informatics · 2019
- Node Max-Cut and Computing Equilibria in Linear Weighted Congestion GamesLeibniz international proceedings in informatics · 2019
- Optimal Single-Choice Prophet Inequalities from SamplesITCS · 2019
- In Search of the Fastest Concurrent Union-Find AlgorithmLeibniz international proceedings in informatics · 2019
- Balancing Covariates in Randomized Experiments with the Gram-Schmidt Walk DesignLeibniz international proceedings in informatics · 2019
- Synthesizing optimally resilient controllersLeibniz international proceedings in informatics · 2019
- Fast Compressed Self-indexes with Deterministic Linear-Time ConstructionAlgorithmica · 2019
- Dynamic Complexity Meets Parameterised AlgorithmsLeibniz international proceedings in informatics · 2019
- An Operational Characterization of Mutual Information in Algorithmic Information TheoryJournal of the ACM · 2019
- Advancing Subgroup Fairness via Sleeping ExpertsLeibniz international proceedings in informatics · 2019