Sciweavers

6437 search results - page 525 / 1288
» Parallel Algorithms for Arrangements
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
SPAA
2005
ACM
15 years 11 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
IPPS
2002
IEEE
15 years 11 months ago
Proving Self-Stabilization with a Proof Assistant
We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to define mathematical objects and properties, and to make proof...
Pierre Courtieu
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
15 years 10 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers
176
Voted
HPCN
1995
Springer
15 years 9 months ago
The Pandore data-parallel compiler and its portable runtime
Abstract. This paper presents an environment for programming distributed memory computers using High Performance Fortran. Emphasis is put on compilation techniques and distributed ...
Françoise André, Marc Le Fur, Yves M...