288 papers
The span from Cs to Fl encompasses a fascinating journey through human and machine intelligence, bridging computer science with the fluid dynamics that govern everything from airflow to ocean currents. This collection brings together research that explores how we model complex systems, optimize algorithms, and simulate the physical world, offering insights that range from theoretical breakthroughs to practical engineering solutions.
At Gist.Science, we track every new preprint in this category as it appears on arXiv, ensuring you never miss a critical development. For each paper, our team provides both a clear, plain-language explanation for broader understanding and a detailed technical summary for deep dives. Below are the latest papers in this dynamic field, ready to expand your knowledge.
This paper establishes that the reachability problem for 3-dimensional Vector Addition Systems with States (3-VASS) is in EXPSPACE by proving a doubly-exponential length bound on shortest runs through a hierarchical pumpability analysis, thereby improving upon the previously known 2-EXPSPACE upper bound.
This paper introduces a unified semantic framework based on interval structures that decomposes operational semantics into independent strategies to encompass diverse reaction system variants and extend to other computational models like Petri nets, thereby providing a common foundation for analyzing and developing computational formalisms.
This paper presents a new, simplified approach for Metric Interval Temporal Logic (MITL) satisfiability that tracks time-constrained obligations along a word and employs a mechanism to merge redundant ones, ensuring a bounded number of obligations and enabling a symbolic procedure based on regions.
This paper proposes a unifying communication complexity model involving two cooperating parties, Alice and Bob, to characterize the regularity of functions with arbitrary output domains and infinite alphabets, generalizing existing results and conjecturing broader applicability.
This paper establishes that model checking for the agent-alternation-free fragment of epistemic metric temporal logic with past, interpreted over finite Büchi automata under synchronous perfect recall, is EXPSPACE-complete, a result achieved by combining temporal test automata with perfect-recall observers to handle the complexities of indistinguishable histories.
This paper presents a real-time, model-checking-based approach for autonomous robots that generates efficient multi-step reactive plans on low-powered devices by chaining temporary control systems and mitigating state-space explosion, thereby overcoming the local minima limitations of traditional one-step-ahead obstacle avoidance methods.
The paper introduces GRID, a grammar-constrained decoding engine that leverages LALR(1) parser states and byte-level trie walks to generate syntactically valid, policy-compliant SQL with provable guarantees, near-constant decoding costs, and tamper-evident audit trails, significantly improving execution accuracy in enterprise settings.
This paper formalizes bounded syntax repair as the intersection of a context-free language with an acyclic Levenshtein automaton to create a finite, parallelizable candidate space for valid string repairs, demonstrating through Python experiments that this grammar-constrained approach significantly improves repair accuracy.
This volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) compiles the contributed papers presented at the 21st International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2026), which was held in Lisbon, Portugal, on July 24, 2026, as a satellite event of FSCD 2026 under the FLoC 2026 conference.
This paper demonstrates that intrinsic redundancy in finite -expansion systems, particularly for multinacci bases, functions as a constrained-language resource for structural integrity through algebraic rewrite identities rather than a substitute for classical error-control redundancy, as genuine single-digit corruptions in canonical codebooks cannot be semantically recovered without external information.