Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 7 · newest first

  1. Finding pairwise intersections of rectangles in a query rectangleComputational Geometry · 2019
  2. Hard Properties with (Very) Short PCPPs and Their ApplicationsITCS · 2019
  3. Local Algorithms for Sparse Spanning GraphsAlgorithmica · 2019
  4. Post-Compromise Security in Self-EncryptionLeibniz international proceedings in informatics · 2019
  5. The cost of global broadcast in dynamic radio networksTheoretical Computer Science · 2019
  6. Lₚ Pattern Matching in a StreamLeibniz international proceedings in informatics · 2019
  7. First-order proofs without syntaxLeibniz international proceedings in informatics · 2019
  8. The Tandem Duplication Distance Is NP-HardLeibniz international proceedings in informatics · 2019
  9. The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus GameLeibniz international proceedings in informatics · 2019
  10. A New Confidence Interval for the Mean of a Bounded Random VariableLeibniz international proceedings in informatics · 2019
  11. Strong Locally Testable Codes with Relaxed Local DecodersACM Transactions on Computation Theory · 2019
  12. Simple Heuristics Yield Provable Algorithms for Masked Low-Rank ApproximationLeibniz international proceedings in informatics · 2019
  13. Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two RoundsLeibniz international proceedings in informatics · 2019
  14. BPPart and BPMax: RNA-RNA Interaction Partition Function and Structure Prediction for the Base Pair Counting ModelLeibniz international proceedings in informatics · 2019
  15. A Weather-Aware Framework for Population Mobility Modelling (Short Paper)Leibniz international proceedings in informatics · 2019
  16. Assigning weights to minimize the covering radius in the planeComputational Geometry · 2019
  17. Approximation algorithms for quantum many-body problemsLeibniz international proceedings in informatics · 2019
  18. A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence ProblemLeibniz international proceedings in informatics · 2019
  19. Geometric Secluded Paths and Planar SatisfiabilityLeibniz international proceedings in informatics · 2019
  20. Matching Is as Easy as the Decision Problem, in the NC ModelLeibniz international proceedings in informatics · 2019
  21. H-games played on vertex sets of random graphsLeibniz international proceedings in informatics · 2019
  22. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third IterationLeibniz international proceedings in informatics · 2019
  23. Correctness of Tendermint-Core BlockchainsLeibniz international proceedings in informatics · 2019
  24. Tight Approximation Algorithms for Bichromatic Graph Diameter and Related ProblemsLeibniz international proceedings in informatics · 2019
  25. Approximating the Orthogonality Dimension of Graphs and HypergraphsLeibniz international proceedings in informatics · 2019
  26. Generalized Assignment via Submodular Optimization with Reserved CapacityLeibniz international proceedings in informatics · 2019
  27. Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State ConversionLeibniz international proceedings in informatics · 2019
  28. Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-ReductionLeibniz international proceedings in informatics · 2019
  29. Stable Memoryless Queuing under ContentionLeibniz international proceedings in informatics · 2019
  30. Trustworthy Graph Algorithms (Invited Talk)Leibniz international proceedings in informatics · 2019
  31. The k-Fréchet Distance: How to Walk Your Dog While TeleportingLeibniz international proceedings in informatics · 2019
  32. Quantified Uncertainty of Flexible Protein-Protein Docking AlgorithmsLeibniz international proceedings in informatics · 2019
  33. Exact Exponential Algorithms for Clustering ProblemsLeibniz international proceedings in informatics · 2019
  34. The Price of Stability of Weighted Congestion GamesLeibniz international proceedings in informatics · 2019
  35. Online Multidimensional Packing Problems in the Random-Order ModelLeibniz international proceedings in informatics · 2019
  36. A Golden Age of Hardware Description Languages: Applying Programming Language Techniques to Improve Design ProductivityLeibniz international proceedings in informatics · 2019
  37. MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors (Tool Insights Paper)Leibniz international proceedings in informatics · 2019
  38. Algorithmically Efficient Syntactic Characterization of Possibility DomainsLeibniz international proceedings in informatics · 2019
  39. A Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilityLeibniz international proceedings in informatics · 2019
  40. Data Types as Quotients of Polynomial FunctorsLeibniz international proceedings in informatics · 2019
  41. Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design FrameworkLeibniz international proceedings in informatics · 2019
  42. Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global SchedulingLeibniz international proceedings in informatics · 2019
  43. NPM-BUNDLE: Non-Preemptive Multitask Scheduling for Jobs with BUNDLE-Based Thread-Level SchedulingLeibniz international proceedings in informatics · 2019
  44. Scalable and Jointly Differentially Private PackingLeibniz international proceedings in informatics · 2019
  45. Two variable fragment of Term Modal LogicLeibniz international proceedings in informatics · 2019
  46. Aperiodic Weighted Automata and Weighted First-Order LogicLeibniz international proceedings in informatics · 2019
  47. Sequentiality of String-to-Context TransducersLeibniz international proceedings in informatics · 2019
  48. A Scalable, Portable, and Memory-Efficient Lock-Free FIFO QueueLeibniz international proceedings in informatics · 2019
  49. A Lower Bound for Sampling Disjoint SetsLeibniz international proceedings in informatics · 2019
  50. Building on the Diamonds between Theories: Theory Presentation CombinatorsLeibniz international proceedings in informatics · 2018