75 citations
- University of AmsterdamNL4 papers
- University of TwenteNL2 papers
- College of Western IdahoUS1 paper
- Eindhoven University of TechnologyNL1 paper
- Max Planck Institute for InformaticsDE1 paper
- Saarland UniversityDE1 paper
- The University of MelbourneAU1 paper
- The University of QueenslandAU1 paper
- University of BristolGB1 paper
- University of CambridgeGB1 paper
- University of WaterlooCA1 paper
- Vrije Universiteit AmsterdamNL1 paper
10 papers
Quantum Algorithms for Matching and Network Flows
Andris Ambainis, Robert Spalek
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time…
Prym varieties associated to graphs
Rudi Salomon
We present a Prym construction which associates abelian varieties to vertex-transitive strongly regular graphs. As an application we construct Prym-Tyurin varieties of arbitrary ex…
Entanglement in Interactive Proof Systems with Binary Answers
Stephanie Wehner
If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [quant-ph/0404076]. We show that for the case where the verifier…
Upper Bound on the Number of Vertices of Polyhedra with -Constraint Matrices
Khaled Elbassioni, Zvi Lotker, Raimund Seidel
In this note we show that the maximum number of vertices in any polyhedron with -constraint matrix and a real vector is at most $d…
On the Complexity of Several Haplotyping Problems
Rudi Cilibrasi, Leo van Iersel, Steven Kelk +1
In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete…
Sample-path large deviations for tandem and priority queues with Gaussian inputs
Michel Mandjes, Miranda van Uitert
This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (tw…