Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 5 · newest first

  1. Quantum Combinatorial Games: Structures and Computational ComplexityLeibniz international proceedings in informatics · 2020
  2. The Robustness of LWPP and WPP, with an Application to Graph ReconstructionLeibniz international proceedings in informatics · 2020
  3. Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic TimeLeibniz international proceedings in informatics · 2020
  4. A Cyclic Proof System for HFLNLeibniz international proceedings in informatics · 2020
  5. Distance Computations in the Hybrid Network Model via Oracle SimulationsLeibniz international proceedings in informatics · 2020
  6. Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial TimeLeibniz international proceedings in informatics · 2020
  7. Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing WeightsLeibniz international proceedings in informatics · 2020
  8. Streaming Enumeration on Nested DocumentsLeibniz international proceedings in informatics · 2020
  9. Atomic Splittable Flow Over Time GamesLeibniz international proceedings in informatics · 2020
  10. Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic ApplicationsLeibniz international proceedings in informatics · 2020
  11. Step-by-step community detection in volume-regular graphsLeibniz international proceedings in informatics · 2020
  12. Characterizing Tractability of Simple Well-Designed Pattern Trees with ProjectionLeibniz international proceedings in informatics · 2020
  13. Efficient Black-Box Reductions for Separable Cost SharingLeibniz international proceedings in informatics · 2020
  14. Truly Asymptotic Lower Bounds for Online Vector Bin PackingLeibniz international proceedings in informatics · 2020
  15. Differentially Private Approximations of a Convex Hull in Low DimensionsLeibniz international proceedings in informatics · 2020
  16. Symmetry Exploitation for Online Machine Covering with Bounded MigrationLeibniz international proceedings in informatics · 2020
  17. Continuous Submodular Function MaximizationLeibniz international proceedings in informatics · 2020
  18. On the Security of Proofs of Sequential Work in a Post-Quantum WorldLeibniz international proceedings in informatics · 2020
  19. Maximizing the strong triadic closure in split graphs and proper interval graphsDiscrete Applied Mathematics · 2020
  20. Tree path majority data structuresLeibniz international proceedings in informatics · 2020
  21. Sparsification of Directed Graphs via Cut BalanceLeibniz international proceedings in informatics · 2020
  22. Decision Tree Heuristics Can Fail, Even in the Smoothed SettingLeibniz international proceedings in informatics · 2020
  23. Finding connected secluded subgraphsJournal of Computer and System Sciences · 2020
  24. A direct proof of Agafonov's theorem and an extension to shift of finite typeLeibniz international proceedings in informatics · 2020
  25. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic ComputationsLeibniz international proceedings in informatics · 2020
  26. Alignment- and reference-free phylogenomics with colored de Bruijn graphsLeibniz international proceedings in informatics · 2020
  27. A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental AdaptationLeibniz international proceedings in informatics · 2020
  28. The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and ApplicationsLeibniz international proceedings in informatics · 2020
  29. Optimal Error Pseudodistributions for Read-Once Branching ProgramsLeibniz international proceedings in informatics · 2020
  30. On the Edge Crossings of the Greedy SpannerLeibniz international proceedings in informatics · 2020
  31. Optimal Multilevel Slashing for BlockchainsLeibniz international proceedings in informatics · 2020
  32. A quantum cellular automaton for one-dimensional QEDLeibniz international proceedings in informatics · 2020
  33. Shortest Paths in the Plane with Obstacle ViolationsLeibniz international proceedings in informatics · 2020
  34. Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure LibrariesLeibniz international proceedings in informatics · 2020
  35. Parameterized low-rank binary matrix approximationLeibniz international proceedings in informatics · 2020
  36. Bounds on Worst-Case Responsiveness for Agreement AlgorithmsLeibniz international proceedings in informatics · 2020
  37. On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut ProblemsLeibniz international proceedings in informatics · 2020
  38. Brief Announcement: Building Fast Recoverable Persistent Data Structures with MontageLeibniz international proceedings in informatics · 2020
  39. Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial ComplexesLeibniz international proceedings in informatics · 2020
  40. Market Pricing for Matroid Rank ValuationsLeibniz international proceedings in informatics · 2020
  41. Designing with Static Capabilities and Effects: Use, Mention, and InvariantsLeibniz international proceedings in informatics · 2020
  42. Strategic Payments in Financial NetworksLeibniz international proceedings in informatics · 2020
  43. Reconstructing Biological and Digital Phylogenetic Trees in ParallelLeibniz international proceedings in informatics · 2020
  44. Low-Stretch Spanning Trees of Graphs with Bounded WidthLeibniz international proceedings in informatics · 2020
  45. Generalised Pattern Matching RevisitedLeibniz international proceedings in informatics · 2020
  46. Approximating Text-To-Pattern Distance via Dimensionality ReductionLeibniz international proceedings in informatics · 2020
  47. The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total TimeLeibniz international proceedings in informatics · 2020
  48. Improved Circular k-Mismatch SketchesLeibniz international proceedings in informatics · 2020
  49. Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network AnalysisLeibniz international proceedings in informatics · 2020
  50. Attack Detection Through Monitoring of Timing Deviations in Embedded Real-Time SystemsLeibniz international proceedings in informatics · 2020