237views Hardware» more  MST 2011»
12 years 11 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
94views more  RSA 2010»
13 years 2 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
99views more  MOR 2007»
13 years 3 months ago
Stochastic Search in a Forest Revisited
We consider a generalization of the model of stochastic search in an out-forest, introduced and studied by Denardo, Rothblum, and Van der Heyden [1]. We provide a simple proof of ...
Jay Sethuraman, John N. Tsitsiklis
60views more  JAMDS 2002»
13 years 3 months ago
A simple proof of Suzumura's extension theorem for finite domains with applications
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
Somdeb Lahiri
77views more  IPL 2000»
13 years 3 months ago
Simplified proof of the Fourier Sampling Theorem
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
Peter Høyer
116views more  SIGACT 2008»
13 years 4 months ago
On-line bipartite matching made simple
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
Benjamin E. Birnbaum, Claire Mathieu
88views more  COMBINATORICA 2008»
13 years 4 months ago
Geometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Rom Pinchasi
13 years 4 months ago
Centerpoints and Tverberg's technique
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
124views more  CAGD 2008»
13 years 4 months ago
All triangulations are reachable via sequences of edge-flips: an elementary proof
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
Eliyahu Osherovich, Alfred M. Bruckstein
13 years 4 months ago
Bisets as Categories and Tensor Product of Induced Bimodules
: Bisets can be considered as categories. This note uses this point of view to give a simple proof of a Mackey-like formula expressing the tensor product of two induced bimodules. ...
Serge Bouc