science.io

Sort: New & recommended · Newly published · Newly added · Top Recommended

1

MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations. (arXiv:1304.5140v2 [cs.DS] UPDATED)
By Irena Rusu
0 · from ArXiv:cs.DS · published 06/2013
1

Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions. (arXiv:1306.3507v1 [cs.FL])
By Jean-Marc Champarnaud,Faissal Ouardi,Djelloul Ziadi
0 · from ArXiv:cs.FL · published 06/2013
1

Automatic functions, linear time and learning. (arXiv:1306.3726v1 [cs.FL])
By John Case,Sanjay Jain,Samuel Seah,Frank Stephan
0 · from ArXiv:cs.FL · published 06/2013
1

Block Maps between Primitive Uniform and Pisot Substitutions. (arXiv:1306.3777v1 [math.DS])
By Ville Salo,Ilkka Törmä
0 · from ArXiv:cs.FL · published 06/2013
1

Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved. (arXiv:1306.3284v1 [cs.DS])
By Edith Cohen
0 · from ArXiv:cs.DS · published 06/2013
1

Set-Difference Range Queries. (arXiv:1306.3482v1 [cs.DS])
By David Eppstein,Michael T. Goodrich,Joseph A. Simons
0 · from ArXiv:cs.DS · published 06/2013
1

Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control. (arXiv:1210.6963v3 [cs.GT] UPDATED)
By Lane A. Hemaspaandra,Rahman Lavaee,Curtis Menton
0 · from ArXiv:cs.DS · published 06/2013
1

Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. (arXiv:1306.3260v1 [cs.FL])
By P. Buckheister,Georg Zetzsche
0 · from ArXiv:cs.FL · published 06/2013
1

Syntactic Complexity of Circular Semi-Flower Automata. (arXiv:1306.3492v1 [cs.FL])
By Shubh Narayan Singh,K. V. Krishna
0 · from ArXiv:cs.FL · published 06/2013
1

Graphs with Plane Outside-Obstacle Representations. (arXiv:1306.2978v1 [cs.CG])
By Alexander Koch,Marcus Krug,Ignaz Rutter
0 · from ArXiv:cs.DS · published 06/2013
1

Matching with our Eyes Closed. (arXiv:1306.2988v1 [cs.DS])
By Gagan Goel,Pushkar Tripathi
0 · from ArXiv:cs.DS · published 06/2013
1

Cole's Parametric Search Technique Made Practical. (arXiv:1306.3000v1 [cs.DS])
By Michael T. Goodrich,Paweł Pszona
0 · from ArXiv:cs.DS · published 06/2013
1

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. (arXiv:1306.3030v1 [cs.DS])
By Karl Bringmann,Christian Engels,Bodo Manthey,B.V. Raghavendra Rao
0 · from ArXiv:cs.DS · published 06/2013
1

Uncapacitated Flow-based Extended Formulations. (arXiv:1306.3119v1 [math.OC])
By Samuel Fiorini,Kanstantsin Pashkovich
0 · from ArXiv:cs.DS · published 06/2013
1

An Efficient Branching Algorithm for Interval Completion. (arXiv:1306.3181v1 [cs.DS])
By Yixin Cao
0 · from ArXiv:cs.DS · published 06/2013
1

The complexity of Free-Flood-It on 2xn boards. (arXiv:1101.5518v3 [cs.DS] UPDATED)
By Kitty Meeks,Alexander Scott
0 · from ArXiv:cs.DS · published 06/2013
1

Modal Interface Automata. (arXiv:1306.3050v1 [cs.LO])
By Gerald Lüttgen,Walter Vogler
0 · from ArXiv:cs.FL · published 06/2013
1

Words with unbounded periodicity complexity. (arXiv:1306.3123v1 [cs.FL])
By Štěpán Holub
0 · from ArXiv:cs.FL · published 06/2013
1

I/O-Efficient Planar Range Skyline and Attrition Priority Queues. (arXiv:1306.2815v1 [cs.DS])
By Casper Kejlberg-Rasmussen,Yufei Tao,Konstantinos Tsakalidis,Kostas Tsichlas,Jeonghun Yoon
0 · from ArXiv:cs.DS · published 06/2013
1

On the Parameterized Complexity of the Maximum Edge Coloring Problem. (arXiv:1306.2931v1 [cs.DS])
By Prachi Goyal,Vikram Kamat,Neeldhara Misra
0 · from ArXiv:cs.DS · published 06/2013
1

Tight Bounds for Distributed Functional Monitoring. (arXiv:1112.5153v3 [cs.DS] UPDATED)
By David P. Woodruff,Qin Zhang
0 · from ArXiv:cs.DS · published 06/2013
1

Modal Specifications for Probabilistic Timed Systems. (arXiv:1306.2695v1 [cs.LO])
By Tingting Han,Christian Krause,Marta Kwiatkowska,Holger Giese
0 · from ArXiv:cs.FL · published 06/2013
1

Solving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor. (arXiv:1207.4577v4 [cs.LO] UPDATED)
By Nathalie Bertrand,Philippe Schnoebelen,
0 · from ArXiv:cs.FL · published 06/2013
1

Motif matching using gapped patterns. (arXiv:1306.2483v1 [cs.DS])
By Emanuele Giaquinta,Kimmo Fredriksson,Szymon Grabowski,Alexandru I. Tomescu,Esko Ukkonen
0 · from ArXiv:cs.DS · published 06/2013
1

Efficient Classification for Metric Data. (arXiv:1306.2547v1 [cs.LG])
By Lee-Ad Gottlieb,Aryeh Kontorovich,Robert Krauthgamer
0 · from ArXiv:cs.DS · published 06/2013
1

Space-Efficient Parallel Algorithms for Combinatorial Search Problems. (arXiv:1306.2552v1 [cs.DS])
By Andrea Pietracaprina,Geppino Pucci,Francesco Silvestri,Fabio Vandin
0 · from ArXiv:cs.DS · published 06/2013
1

A note on small cuts for a terminal. (arXiv:1306.2578v1 [cs.DS])
By Yixin Cao
0 · from ArXiv:cs.DS · published 06/2013
1

Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence. (arXiv:1303.5479v2 [cs.DS] UPDATED)
By Mikkel Thorup
0 · from ArXiv:cs.DS · published 06/2013
1

New Inapproximability Bounds for TSP. (arXiv:1303.6437v2 [cs.CC] UPDATED)
By Marek Karpinski,Michael Lampis,Richard Schmied
0 · from ArXiv:cs.DS · published 06/2013
1

Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. (arXiv:1306.2079v2 [cs.DS] UPDATED)
By Martin Fink,Sergey Pupyrev
0 · from ArXiv:cs.DS · published 06/2013

more ->