output
20022013
most citedQuantum Computing

3.6k citations

Showing 2013Show all

26 papers · 1 filter

cs.FL20131 cited

Sets Represented as the Length-n Factors of a Word

Shuo Tan, Jeffrey Shallit

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how…

cs.AI2013

Lp : A Logic for Statistical Information

Fahiem Bacchus

This extended abstract presents a logic, called Lp, that is capable of representing and reasoning with a wide variety of both qualitative and quantitative statistical information.…

math.CO20138 cited

On the Longest Paths and the Diameter in Random Apollonian Networks

Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4

We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…

math.CO20133 cited

Non-Uniqueness of Minimal Superpermutations

Nathaniel Johnston

We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n…

cs.DS20135 cited

Distributed Dominating Sets on Grids

Elaheh Fata, Stephen L. Smith, Shreyas Sundaram

This paper presents a distributed algorithm for finding near optimal dominating sets on grids. The basis for this algorithm is an existing centralized algorithm that constructs dom…

math.OC2013

Rebalancing the Rebalancers: Optimally Routing Vehicles and Drivers in Mobility-on-Demand Systems

Stephen L. Smith, Marco Pavone, Mac Schwager +2

In this paper we study rebalancing strategies for a mobility-on-demand urban transportation system blending customer-driven vehicles with a taxi service. In our system, a customer…