Working Paper (44)
461.
Working Paper
Linear Integer Arithmetic Revisited. (2015), 34 pp.
462.
Working Paper
First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation. (2015), 16 pp.
463.
Working Paper
On Defining SPARQL with Boolean Tensor Algebra. (2015)
464.
Working Paper
NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. (2015), 43 pp.
465.
Working Paper
Foundational Extensible Corecursion. (2015), 12 pp.
466.
Working Paper
Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings. (2015), 31 pp.
467.
Working Paper
A Probabilistic Approach to Reducing the Algebraic Complexity of Computing Delaunay Triangulations. (2015), 24 pages pp.
468.
Working Paper
Algebraic Methods in the Congested Clique. (2015), 30 pp.
469.
Working Paper
Self-Adjusting Binary Search Trees: What Makes Them Tick? (2015), 19 pp.
470.
Working Paper
Greedy Is an Almost Optimal Deque. (2015), 15 pp.
471.
Working Paper
Pattern-avoiding Access in Binary Search Trees. (2015), To be presented at FOCS 2015 pp.
472.
Working Paper
Polynomial Kernelization for Removing Induced Claws and Diamonds. (2015), 17 pp.
473.
Working Paper
Improved Balanced Flow Computation Using Parametric Flow. (2015), 6 pp.
474.
Working Paper
Node-balancing by Edge-increments. (2015), 10 pages pp.
475.
Working Paper
The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS. (2015), 31 pp.
476.
Working Paper
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. (2015), 36 pp.
477.
Working Paper
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. (2015), 20 pp.
478.
Working Paper
Near-Optimal Distributed Maximum Flow. (2015), 34 pages, 5 figures, conference version appeared in ACM Symp. on Principles of Distributed Computing (PODC) 2015 pp.
479.
Working Paper
Optimising Spatial and Tonal Data for PDE-based Inpainting. (2015), 54 pp.
480.
Working Paper
What Makes for Effective Detection Proposals? (2015), 16 pp.