- To appear in the proceedings of IMA Workshop on Parallel Algorithms, Sept. 1996, Minneapolis, MN A GENERAL PURPOSE SHAREDMEMORY MODEL
- Cores and Connectivity in Sparse Random Graphs Daniel Fernholz
- In SIAM JOURNAL ON COMPUTING, 1996. Copyright SIAM AN EFFICIENT PARALLEL ALGORITHM FOR THE GENERAL
- Computational Bounds for Fundamental Problems on GeneralPurpose Parallel Models \Lambda
- Chapter in SYNTHESIS OF PARALLEL ALGORITHMS, MorganKaufmann, 1993. (Figures not yet included in this file.) Parallel Open Ear Decomposition
- An Extended Abstract appears in Proc. ISAAC'97, LNCS 1350, pp. 212-222. A Randomized Linear Work EREW PRAM
- Experimental Evaluation of QSM, a Simple Shared-Memory Model
- In SIAM JOURNAL ON COMPUTING, 1996. Copyright SIAM AN EFFICIENT PARALLEL ALGORITHM FOR THE GENERAL
- In IEEE Symp. on Foundations of Comp. Sci. (FOCS'91). Copyright IEEE A Linear Time Algorithm for Triconnectivity Augmentation 1
- In SIAM J. Computing, 1993, pp. 587616. FINDING TRICONNECTED COMPONENTS BY LOCAL
- In J. Computer and Systems Sciences, vol. 49, 1994, pp. 517-561. (For figures see pp. 47-54.) Planarity Testing in Parallel
- In IEEE Symp. on Foundations of Comp. Sci. (FOCS'91). Copyright IEEE A Linear Time Algorithm for Triconnectivity Augmentation1
- An extended abstract appears in Proc. ACM Symp. Parallel Algs. and Architectures (SPAA'97) Modeling Parallel Bandwidth
- The Giant k-core of a Random Graph with a Speci ed Degree Daniel Fernholz
- Algorithms for Multicore Computing Vijaya Ramachandran
- In COMBINATORICA, vol. 12, 1992, pp. 5376. (Figures not yet included in this file.) A New Graph Triconnectivity Algorithm and Its Parallelization*
- On ContractandRefine Transformations Between Phylogenetic Trees Ganeshkumar Ganapathy Vijaya Ramachandran + Tandy Warnow
- A APPENDIX: AN EXAMPLE TO ILLUSTRATE ALGORITHM 1 28 Figure 11: The primal graph G when the do loop in step 4 of Algorithm 1 terminates.
- An extended abstract appears in Proc. ACM Symp. Parallel Algs. and Architectures (SPAA'97) Modeling Parallel Bandwidth
- In J. Computer and Systems Sciences, vol. 49, 1994, pp. 517561. (For figures see pp. 4754.) Planarity Testing in Parallel *
- In J. of Algorithms, vol. 12, 1991, pp. 110125 TRANSITIVE COMPACTION IN PARALLEL VIA BRANCHINGS
- In SIAM JOURNAL ON COMPUTING, 1993. Copyright SIAM On Finding a Smallest Augmentation to Biconnect a Graph \Lambda
- Cores and Connectivity in Sparse Random Graphs Daniel Fernholz
- To appear in THEORETICAL COMPUTER SCIENCE, 1997. Copyright Elsevier ERCW PRAMs and Optical Communication
- In J. of Algorithms, vol. 12, 1991, pp. 110-125 TRANSITIVE COMPACTION IN PARALLEL VIA BRANCHINGS
- In COMBINATORICA, vol. 12, 1992, pp. 53-76. (Figures not yet included in this file.) A New Graph Triconnectivity Algorithm and Its Parallelization*
- In J. Comp. Sys. Sci., FOCS'87 Special Issue, vol. 42, 1991, pp. 110125. (Figures are not yet included in this file.) IMPROVED ALGORITHMS FOR GRAPH FOUR
- An Extended Abstract will appear in Proc. European Symp. on Algorithms (ESA'97) QuasiFully Dynamic Algorithms for TwoConnectivity, Cycle
- In SIAM JOURNAL ON COMPUTING, 1995. Copyright SIAM Computing Minimal Spanning Subgraphs in Linear Time
- On Contract-and-Refine Transformations Between Phylogenetic Trees Ganeshkumar Ganapathy
- Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits
- A Universal Construction for Wait-Free Transaction Friendly Data Structures
- An Extended Abstract will appear in Proc. European Symp. on Algorithms (ESA'97) Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle
- In JOURNAL OF ALGORITHMS, 1995. Copyright Academic Press On Finding Minimal TwoConnected Subgraphs \Lambda
- [LLG + 90] D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy. The directory based cache coherence protocol for the DASH multiprocessor. In Proc. 17th International
- CacheOblivious Shortest Paths in Graphs Using Buffer Heap
- The Cache-oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental
- VIJAYA RAMACHANDRAN The University of Texas at Austin
- An Extended Abstract appears in Proc. ISAAC'97, LNCS 1350, pp. 212222. A Randomized Linear Work EREW PRAM
- IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, MANUSCRIPT ID ?????????? 1 Cache-oblivious Dynamic Programming for
- To appear in THEORETICAL COMPUTER SCIENCE, 1997. Copyright Elsevier The QueueRead QueueWrite
- [Rei93] J. H. Reif, editor. A Synthesis of Parallel Algorithms. MorganKaufmann, San Mateo, [RR89] S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel
- To appear in Theory of Computing Systems (Special Issue for SPAA'97) Can a SharedMemory Model Serve as a
- LLG+90 D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy. The directory-based cache coherence protocolfor the DASH multiprocessor. InProc. 17th International
- In J. Comp. Sys. Sci., FOCS'87 Special Issue, vol. 42, 1991, pp. 110-125. (Figures are not yet included in this file.) IMPROVED ALGORITHMS FOR GRAPH FOUR-
- Cache-efficient Dynamic Programming Algorithms for Rezaul Alam Chowdhury
- branching factor b n/o children per
- To appear in Theory of Computing Systems (Special Issue for SPAA'97) Can a Shared-Memory Model Serve as a
- A slightly different version appears in IPL 62(3):153-159, 1997 An Optimal EREW PRAM Algorithm For Minimum Spanning
- Rei93 J. H. Reif, editor. A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, RR89 S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel
- A APPENDIX: AN EXAMPLE TO ILLUSTRATE ALGORITHM 1 28 Figure 11: The primal graph G when the do loop in step 4 of Algorithm 1 terminates.
- Chapter in SYNTHESIS OF PARALLEL ALGORITHMS, Morgan-Kaufmann, 1993. (Figures not yet included in this file.) Parallel Open Ear Decomposition
- In SIAM J. Computing, 1993, pp. 587-616. FINDING TRICONNECTED COMPONENTS BY LOCAL
- To appear in the proceedings of IMA Workshop on Parallel Algorithms, Sept. 1996, Minneapolis, MN A GENERAL PURPOSE SHARED-MEMORY MODEL
- Experimental Evaluation of a New Shortest Path Algorithm Seth Pettie, Vijaya Ramachandran, and Srinath Sridhar
- To appear in THEORETICAL COMPUTER SCIENCE, 1997. Copyright Elsevier ERCW PRAMs and Optical Communication
- Resource Oblivious Sorting on Multicores Richard Cole and Vijaya Ramachandran
- In SIAM JOURNAL ON COMPUTING, 1995. Copyright SIAM Computing Minimal Spanning Subgraphs in Linear Time
- Computational Bounds for Fundamental Problems on General-Purpose Parallel Models
- In JOURNAL OF ALGORITHMS, 1995. Copyright Academic Press On Finding Minimal Two-Connected Subgraphs
- In SIAM JOURNAL ON COMPUTING, 1993. Copyright SIAM On Finding a Smallest Augmentation to Biconnect a Graph
- A slightly different version appears in IPL 62(3):153159, 1997 An Optimal EREW PRAM Algorithm For Minimum Spanning
- SIAM J. COMPU'E Vol. 21, No. 4, pp. 755-780, August 1992
- External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs *
- Competitive Cache Replacement Strategies for Shared Cache Environments Anil Kumar Katti
- Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and
- Efficient Resource Oblivious Algorithms for Multicores with False Sharing Richard Cole
- Anil Kumar Katti The Thesis committee for Anil Kumar Katti
- Revisiting the Cache Miss Analysis of Multithreaded Algorithms