MST

2011

12 years 11 months ago
2011

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 ...

RSA

2010

13 years 2 months ago
2010

We study here the spectra of random lifts of graphs. Let G be a ﬁnite connected graph, and let the inﬁnite tree T be its universal cover space. If λ1 and ρ are the spectral ...

MOR

2007

13 years 3 months ago
2007

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 ...

JAMDS

2002

13 years 3 months ago
2002

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...

IPL

2000

13 years 3 months ago
2000

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...

SIGACT

2008

13 years 4 months ago
2008

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...

COMBINATORICA

2008

13 years 4 months ago
2008

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...

COMGEO

2010

ACM

13 years 4 months ago
2010

ACM

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...

CAGD

2008

13 years 4 months ago
2008

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.

ACS

2010

13 years 4 months ago
2010

: 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. ...