Synapse

← Leibniz international proceedings in informatics

Papers in Leibniz international proceedings in informatics

Page 1 · newest first

  1. On the Existential Theory of the Reals Enriched with Integer Powers of a Computable NumberLogical Methods in Computer Science · 2026
  2. On the Efficiency of Dynamic Transaction Scheduling in Blockchain ShardingLeibniz international proceedings in informatics · 2026
  3. Some geometric applications of the discrete heat flowAnnales de l’institut Fourier · 2026
  4. Distributed download from an external data source in Byzantine majority settingsDistributed Computing · 2026
  5. Translating Between the Representations of an Acyclic Convex Geometry of Bounded DegreeThe Electronic Journal of Combinatorics · 2026
  6. The Converse of the Real Orthogonal Holant TheoremTheoretiCS · 2026
  7. A Formalization of the Ionescu-Tulcea Theorem in MathlibLeibniz international proceedings in informatics · 2026
  8. Online Disjoint Spanning Trees and Polymatroid BasesLeibniz international proceedings in informatics · 2026
  9. Non-Deterministic Abstract MachinesLeibniz international proceedings in informatics · 2026
  10. New Tradeoffs for Decremental Approximate All-Pairs Shortest PathsLeibniz international proceedings in informatics · 2026
  11. Light Reliable SpannersLeibniz international proceedings in informatics · 2026
  12. Limit laws for critical dispersion on complete graphsThe Annals of Applied Probability · 2026
  13. On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groupsComputational Complexity · 2026
  14. Max Weight Independent Set in sparse graphs with no long clawsLeibniz international proceedings in informatics · 2026
  15. NLTS Hamiltonians from Good Quantum CodesLeibniz international proceedings in informatics · 2026
  16. Unavoidable patterns and plane paths in dense topological graphsEuropean Journal of Combinatorics · 2026
  17. String problems in the congested clique modelLeibniz international proceedings in informatics · 2026
  18. Coordinated motion planning: Multi-agent path finding in a densely packed, bounded domainLeibniz international proceedings in informatics · 2026
  19. A Dichotomy Theorem for Ordinal Ranks in MSOLogical Methods in Computer Science · 2026
  20. Sublinear Space Graph Algorithms in the Continual Release ModelJournal of Privacy and Confidentiality · 2026
  21. Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality NumberLeibniz international proceedings in informatics · 2026
  22. On cycles in monotone grid classes of permutationsLeibniz international proceedings in informatics · 2026
  23. Slit-slide-sew bijections for oriented planar mapsLeibniz international proceedings in informatics · 2026
  24. Tensor reconstruction beyond constant rankComputational Complexity · 2026
  25. Lower Bounds for Symmetric Circuits for the DeterminantACM Transactions on Computation Theory · 2026
  26. DivQuant: Estimation of Species Richness and Entropy from Small SamplesLeibniz international proceedings in informatics · 2026
  27. A Lower Bound on the Trace Norm of Boolean Matrices and its ApplicationsLeibniz international proceedings in informatics · 2026
  28. Fast Set Operations for Compact k -mer SetsLeibniz international proceedings in informatics · 2026
  29. CoSTAR: Coarse Stem-Topology Alignment of Pseudoknotted RNA Structures by Relation-Constrained SearchLeibniz international proceedings in informatics · 2026
  30. Construction of distinct k -mer color sets via set fingerprintingLeibniz international proceedings in informatics · 2026
  31. Dynamic debt swapping in financial networksLeibniz international proceedings in informatics · 2026
  32. Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel PredictionsLeibniz international proceedings in informatics · 2026
  33. Beyond FLOPs: Energy-Aware Knowledge Distillation for Sustainable LLMs on Code-Related TaskLeibniz international proceedings in informatics · 2026
  34. On the Complexity of Locally Dense LatticesLeibniz international proceedings in informatics · 2026
  35. Hardness of the Binary Covering Radius Problem in Large ₚ NormsLeibniz international proceedings in informatics · 2026
  36. Lower Bounds Beyond DNF of ParitiesLeibniz international proceedings in informatics · 2026
  37. Equivalence Between Coding and Complexity Lower BoundsLeibniz international proceedings in informatics · 2026
  38. Frontier Space-Time Algorithms Using Only Full MemoryLeibniz international proceedings in informatics · 2026
  39. Constructing Small Monadic Decompositions in Presburger ArithmeticLeibniz international proceedings in informatics · 2026
  40. ARIA - An Agentic Framework for Autonomous Testing of Infotainment SystemsLeibniz international proceedings in informatics · 2026
  41. Bounds for Hardness Condensation in the Query ModelLeibniz international proceedings in informatics · 2026
  42. White-Box Adversarial Streaming Lower Bounds Beyond Two-Party CommunicationLeibniz international proceedings in informatics · 2026
  43. On Proof Systems for #QBFLeibniz international proceedings in informatics · 2026
  44. Derandomizing Logspace With a Small Shared Hard DriveComputational Complexity · 2025
  45. The Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and FriendsLeibniz international proceedings in informatics · 2025
  46. Mind the Gap? Not for SVP Hardness Under ETH!Leibniz international proceedings in informatics · 2025
  47. Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse GraphsTheoretiCS · 2025
  48. A constant-factor approximation for weighted bond coverJournal of Computer and System Sciences · 2025
  49. Abstraction Liquidity TheoryLeibniz international proceedings in informatics · 2025
  50. Generalised Linial-Nisan Conjecture Is False for DNFsLeibniz international proceedings in informatics · 2025