Sciweavers

8917 search results - page 479 / 1784
» Abstraction in Algorithm Animation
Sort
View
HPCN
1995
Springer
15 years 10 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...
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 10 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...
174
Voted
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
15 years 10 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky
ANTS
2010
Springer
248views Algorithms» more  ANTS 2010»
15 years 10 months ago
Huff's Model for Elliptic Curves
Abstract. This paper revisits a model for elliptic curves over Q introduced by Huff in 1948 to study a diophantine problem. Huff's model readily extends over fields of odd cha...
Marc Joye, Mehdi Tibouchi, Damien Vergnaud
172
Voted
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 10 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin