Conferences in DBLP
Mingdong Feng , Charles E. Leiserson Efficient Detection of Determinacy Races in Cilk Programs. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:1-11 [Conf ] Guy E. Blelloch , Phillip B. Gibbons , Girija J. Narlikar , Yossi Matias Space-Efficient Scheduling of Parallelism with Synchronization Variables. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:12-23 [Conf ] Giovanni Della-Libera , Nir Shavit Reactive Diffracting Trees. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:24-32 [Conf ] Leonid Oliker , Rupak Biswas Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:33-42 [Conf ] Horst D. Simon , Andrew Sohn , Rupak Biswas HARP: A Fast Spectral Partitioner. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:43-52 [Conf ] Zvi Galil , Jong Geun Park , Kunsoo Park Three-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:53-62 [Conf ] Mauro Leoncini , Giovanni Manzini , Luciano Margara On the Parallel Complexity of Matrix Factorization Algorithms. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:63-71 [Conf ] Phillip B. Gibbons , Yossi Matias , Vijaya Ramachandran Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:72-83 [Conf ] Spyros C. Kontogiannis , Grammati E. Pantziou , Paul G. Spirakis Efficient Computations on Fault-Prone BSP Machines. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:84-93 [Conf ] Micah Adler , Phillip B. Gibbons , Vijaya Ramachandran , Yossi Matias Modeling Parallel Bandwidth: Local vs. Global Restrictions. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:94-105 [Conf ] Frank K. H. A. Dehne , Wolfgang Dittrich , David A. Hutchinson Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. [Citation Graph (1, 0)][DBLP ] SPAA, 1997, pp:106-115 [Conf ] Brent N. Chun , Alan M. Mainwaring , Saul Schleimer , Daniel Shawcross Wilkerson System Area Network Mapping. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:116-126 [Conf ] Melanie L. Fulgham , Lawrence Snyder Triplex: A Multi-Class Routing Algorithm. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:127-138 [Conf ] Ludek Kucera Bounds to the Throughput of an Interconnection Network. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:139-148 [Conf ] Loren Schwiebert Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:149-158 [Conf ] Suprakash Datta , Ramesh K. Sitaraman The Performance of Simple Routing Algorithms That Drop Packets. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:159-169 [Conf ] Michele Flammini , Christian Scheideler Simple, Efficient Routing Schemes for All-Optical Networks. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:170-179 [Conf ] Dominique Barth , Pierre Fraigniaud Approximation Algorithms for Structured Communication Problems. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:180-188 [Conf ] Andrew Sohn , Yuetsu Kodama , Jui Ku , Mitsuhisa Sato , Hirofumi Sakane , Hayato Yamana , Shuichi Sakai , Yoshinori Yamaguchi Fine-Grain Multithreading with the EM-X Multiprocessor. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:189-198 [Conf ] Parthasarathy Ranganathan , Vijay S. Pai , Sarita V. Adve Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency Models. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:199-210 [Conf ] Aman Singla , Umakishore Ramachandran , Jessica K. Hodgins Temporal Notions of Synchronization and Consistency in Beehive. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:211-220 [Conf ] Jop F. Sibeyn Better Trade-Offs for Parallel List Ranking. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:221-230 [Conf ] Gene Cooperman , Michael Tselman Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:231-238 [Conf ] Jonathan C. Hardwick Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:239-248 [Conf ] Guy E. Blelloch , Margaret Reid-Miller Pipelining with Futures. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:249-259 [Conf ] Uzi Vishkin From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:260-271 [Conf ] Xinan Tang , Jing Wang , Kevin B. Theobald , Guang R. Gao Thread Partitioning and Scheduling Based on Cost Model. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:272-281 [Conf ] Nimrod Megiddo , Vivek Sarkar Optimal Weighted Loop Fusion for Parallel Programs. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:282-291 [Conf ] Michael Mitzenmacher On the Analysis of Randomized Load Balancing Schemes. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:292-301 [Conf ] Petra Berenbrink , Friedhelm Meyer auf der Heide , Klaus Schröder Allocating Weighted Jobs in Parallel. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:302-310 [Conf ] C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa Accessing Nearby Copies of Replicated Objects in a Distributed Environment. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:311-320 [Conf ] Mohammed Javeed Zaki , Srinivasan Parthasarathy , Wei Li A Localized Algorithm for Parallel Association Mining. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:321-330 [Conf ]