Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 6 · newest first

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