• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 40 matches

• 1996
• 
  Micah Adler:
  Asynchronous Shared Memory Search Structures. SPAA 1996: 42-51
• 
  Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang:
  Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). SPAA 1996: 52-61
• 
  Yonatan Aumann, Michael A. Bender, Lisa Zhang:
  Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996: 270-276
• 
  Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
  A Tight Layout of the Butterfly Network. SPAA 1996: 170-175
• 
  Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter:
  Simple Randomized Mergesort on Parallel Disks. SPAA 1996: 109-118
• 
  Armin Bäumker, Wolfgang Dittrich:
  Fully Dynamic Search Trees for an Extension of the BSP Model. SPAA 1996: 233-242
• 
  Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
  BSP vs LogP. SPAA 1996: 25-32
• 
  Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, Keith H. Randall:
  An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. SPAA 1996: 297-308
• 
  Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
  µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199
• 
  Soumen Chakrabarti, S. Muthukrishnan:
  Resource Scheduling for Parallel Database and Scientific Applications. SPAA 1996: 329-335
• 
  Ludmila Cherkasova, Al Davis, Robin Hodgson, Vadim E. Kotov, Ian N. Robinson, Tomas Rokicki:
  Components of Congestion Control. SPAA 1996: 208-210
• 
  Richard Cole, Philip N. Klein, Robert Endre Tarjan:
  Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA 1996: 243-250
• 
  Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
  On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA 1996: 131-141
• 
  Xiaotie Deng, Patrick W. Dymond:
  On Multiprocessor System Scheduling. SPAA 1996: 82-88
• 
  Pierre Fraigniaud, Cyril Gavoille:
  Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188
• 
  Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman:
  On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317
• 
  Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
  Deterministic Sorting and Randomized Median Finding on the BSP Model. SPAA 1996: 223-232
• 
  Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz:
  First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract). SPAA 1996: 72-81
• 
  Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas:
  Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996: 1-12
• 
  David R. Helman, David A. Bader, Joseph F. JáJá:
  Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract). SPAA 1996: 211-222
• 
  Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein:
  Load-Sharing in Heterogeneous Systems via Weighted Factoring. SPAA 1996: 318-328
• 
  David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
  Parallel Neighborhood Modeling. SPAA 1996: 204-207
• 
  Liviu Iftode, Jaswinder Pal Singh, Kai Li:
  Scope Consistency: A Bridge Between Release Consistency and Entry Consistency. SPAA 1996: 277-287
• 
  Christoph W. Keßler, Jesper Larsson Träff:
  A Library of Basic PRAM Algorithms and its Implementation in FORK. SPAA 1996: 193-195
• 
  Michael Mitzenmacher:
  Constant Time per Edge is Optimal on Rooted Tree Networks. SPAA 1996: 162-169
• 
  Seungjoon Park, David L. Dill:
  Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions. SPAA 1996: 288-296
• 
  Kevin J. Rappoport:
  On the Slowdown of Efficient Simulations of Multibutterflies on Butterflies and Butterfly-Derived Networks. SPAA 1996: 176-182
• 
  Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann:
  On the Communication Throughput of Buffered Multistage Interconnection Networks. SPAA 1996: 152-161
• 
  Vivek Sarkar, Barbara Simons:
  Anticipatory Instruction Scheduling. SPAA 1996: 119-130
• 
  Christian Scheideler, Berthold Vöcking:
  Universal Continuous Routing Strategies. SPAA 1996: 141-151

skipping 10 more matches