Search results for "CRCW-PRAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
138	Torben Hagerup	Fast and Optimal Simulations between CRCW PRAMs.	STACS	1992	DBLP DOI BibTeX RDF
102	Tatsuya Hayashi, Koji Nakano, Stephan Olariu	Work-Time Optimal k-Merge Algorithms on the PRAM.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	work-time optimal algorithms, information retrieval, parallel algorithms, databases, query processing, sorting, Merging
100	Yu-Hua Lee, Shi-Jinn Horng	Fast parallel chessboard distance transform algorithms.	ICPADS	1996	DBLP DOI BibTeX RDF	fast parallel chessboard distance transform algorithms, diagonal propagation approach, O(N2) time sequential algorithm, 2-D binary image array, parallel algorithms, computational complexity, image processing, computational geometry, hypercube networks, medial axis transform, EREW PRAM model, hypercube computer, CRCW PRAM model
100	G. Sajith, Sanjeev Saxena	Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.	Algorithmica	2000	DBLP DOI BibTeX RDF	CRCW model, Tree colouring, Parallel algorithms, Optimal algorithms, Maximal independent set
87	Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih	Parallel Algorithms for Single-Layer Channel Routing.	ISAAC	1993	DBLP DOI BibTeX RDF
83	Yuh-Rau Wang, Shi-Jinn Horng	An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	Computer vision, parallel algorithm, image processing, Voronoi diagram, Euclidean distance transform, CRCW PRAM model
78	Yossi Matias, Uzi Vishkin	A note on reducing parallel model simulations to integer sorting.	IPPS	1995	DBLP DOI BibTeX RDF	parallel model simulations, FETCH&ADD PRAM model, parallel algorithms, sorting, hashing, bootstrapping, bootstrapping, EREW PRAM, CRCW PRAM, simulation algorithms, integer sorting
69	Stanley C. Eisenstat	O(log* n) algorithms on a Sum-CRCW PRAM.	Computing	2007	DBLP DOI BibTeX RDF	parallel prefix sums, linear integer sorting, Parallel random access machine
68	Lin Chen 0001	Optimal overlap representations.	ISPAN	1996	DBLP DOI BibTeX RDF	optimal overlap representations, minimal interval, circular arc overlap representations, minimal interval overlap representation, EREW PRAM processors, common CRCW PRAM, BSR processors, parallel algorithms, computational complexity, computational geometry, optimal algorithms
68	Mikhail J. Atallah	A Faster Parallel Algorithm for a Matrix Searching Problem.	SWAT	1990	DBLP DOI BibTeX RDF
65	Torben Hagerup, Tomasz Radzik	Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.	SPAA	1990	DBLP DOI BibTeX RDF
64	Lin Chen 0001	Optimal Circular Arc Representations.	Euro-Par	1995	DBLP DOI BibTeX RDF
64	Lorrie Fava Lindon, Selim G. Akl	An Optimal Implementation of Broadcasting with Selective Reduction.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	optimal implementation, broadcasting with selective reduction, concurrent-read concurrent-write, concurrentmemory access, BROADCAST instruction, memory locations, parallel computation, parallel random access machine, PRAM, instruction sets, random-access storage, parallelalgorithms
64	Peter J. Varman, Kshitij A. Doshi	Improved parallel algorithms for the depth-first search and monotone circuit value problems.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
60	Miroslaw Kutylowski, Krzysztof Lorys	Limitations of the QRQW and EREW PRAM Models.	FSTTCS	1996	DBLP DOI BibTeX RDF
60	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Optimal Parallel Algorithms for Sparse Graphs.	WG	1990	DBLP DOI BibTeX RDF
59	Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen	An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees.	IPPS	1997	DBLP DOI BibTeX RDF	efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM
59	Xiaotie Deng, Binhai Zhu	A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.	IPPS	1996	DBLP DOI BibTeX RDF	coarse grained multiprocessors, randomized parallel algorithm, local operations, global-operations, messages per processor, global data dependency, communication phases, parallel algorithms, computational complexity, computational geometry, probability, randomized algorithm, Voronoi diagram, parallel machines, computation time, line segments, randomised algorithms, random-access storage, CRCW PRAM model
59	Zvi Galil	A Constant-Time Optimal Parallel String-Matching Algorithm.	J. ACM	1995	DBLP DOI BibTeX RDF	lion hunting, string matching, period, CRCW-PRAM, optimal parallel algorithm, constant time
59	Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu	On the Parallel Computation of the Algebraic Path Problem.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem
55	Chang-Wu Yu 0001, Gen-Huey Chen	An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Bipartite-permutation graph, graph recognition, parallel algorithm and parallel random access machine, graph isomorphism
51	Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam	Improving Parallel Computation with Fast Integer Sorting.	COCOON	1999	DBLP DOI BibTeX RDF	Parallel algorithms, graph algorithms, minimum spanning tree, PRAM, integer sorting
51	Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde	Retrieval of scattered information by EREW, CREW and CRCW PRAMs.	SWAT	1992	DBLP DOI BibTeX RDF
46	Fady Ghanim, Wael R. Elwasif, David E. Bernholdt	Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM.	ICPP Workshops	2021	DBLP DOI BibTeX RDF
46	Muhammad Rashid	The CRCW-PRAM Voronoi Diagram and Proximity Problems.	PDPTA	2005	DBLP BibTeX RDF
46	Valentin E. Brimkov	Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns.	Int. J. Pattern Recognit. Artif. Intell.	2001	DBLP DOI BibTeX RDF
46	Biing-Feng Wang	Simulating the CRCW PRAM on Reconfigurable Networks.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
46	Ludek Kucera	Computing OR on a Randomized Fixed Adversary CRCW PRAM.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
46	Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk	O(log log n)-Time Integer Geometry on the CRCW PRAM.	Algorithmica	1995	DBLP DOI BibTeX RDF
46	W. Melody Moh, Charles U. Martel, Teng-Sheng Moh	Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations.	Parallel and Distributed Computing and Systems	1995	DBLP BibTeX RDF
46	Naomi Nishimura	Restricted CRCW PRAM.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
46	Mounir Hamdi	Efficient CRCW PRAM Emulation on Practical Networks.	ICPP (3)	1994	DBLP DOI BibTeX RDF
46	Paraskevi Fragopoulou	On the Comparative Powers of the 2D-Parbs and the CRCW-Pram Models.	Parallel Process. Lett.	1993	DBLP DOI BibTeX RDF
46	Alberto Apostolico	Efficient CRCW-PRAM Algorithms for Universal Substring Searching.	Theor. Comput. Sci.	1993	DBLP DOI BibTeX RDF
46	Alexander A. Shvartsman	Achieving Optimal CRCW PRAM Fault-Tolerance.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
46	Paul Beame	Lower bounds for recognizing small cliques on CRCW PRAM's.	Discret. Appl. Math.	1990	DBLP DOI BibTeX RDF
46	Paul Beame, Johan Håstad	Optimal bounds for decision problems on the CRCW PRAM.	J. ACM	1989	DBLP DOI BibTeX RDF
46	Paul Beame, Johan Håstad	Optimal Bounds for Decision Problems on the CRCW PRAM	STOC	1987	DBLP DOI BibTeX RDF
45	Jie Li 0002, Yi Pan 0001, Hong Shen 0001	More Efficient Topological Sort Using Reconfigurable Optical Buses.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	time complexity, analysis of algorithms, massive parallelism, graph problem, optical bus
45	Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi	Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	Parallel algorithms, trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique
45	Piotr Berman, Andrzej Lingas	A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
45	José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe 0001	An Optimal Parallel Algorithm for Learning DFA.	COLT	1994	DBLP DOI BibTeX RDF
45	Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha	A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.	PARLE	1993	DBLP DOI BibTeX RDF
41	Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara	A Parallel Algorithm for Weighted Distance Transforms.	IPPS	1997	DBLP DOI BibTeX RDF
41	Krzysztof Diks, Torben Hagerup	More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.	WG	1996	DBLP DOI BibTeX RDF
41	Martti Forsell, Martti Penttonen, Ville Leppänen	Efficient Two-Level Mesh based Simulation of PRAMs.	ISPAN	1996	DBLP DOI BibTeX RDF	time-processor optimal, simulation, interconnection network, mesh, PRAM, shared memory machine
41	Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann	Shared Memory Simulations with Triple-Logarithmic Delay.	ESA	1995	DBLP DOI BibTeX RDF
41	Hans L. Bodlaender, Torben Hagerup	Parallel Algorithms with Optimal Speedup for Bounded Treewidth.	ICALP	1995	DBLP DOI BibTeX RDF
41	Joseph Gil	Fast load balancing on a PRAM.	SPDP	1991	DBLP DOI BibTeX RDF
36	Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev	Theoretical Issues of Cluster Pattern Interfaces.	IWCIA	2009	DBLP DOI BibTeX RDF	carpet encoding, cluster pattern interface CLUSPI, parallel algorithm, CRCW-PRAM model
36	Jean Frédéric Myoupo, David Semé	Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.	J. Supercomput.	2006	DBLP DOI BibTeX RDF	Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point
36	Ming-Bo Lin, A. Yavuz Oruç	Constant Time Inner Product and Matrix Computations on Permutation Network Processors.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	constant time inner product, permutation network processors, algebraic computations, cost complexities, computational complexity, parallel architectures, time complexities, matrix algebra, PRAM, parallel computation model, matrix computations, CRCW PRAM
36	Shiva Chaudhuri	Sensitive Functions and Approximate Problems	FOCS	1993	DBLP DOI BibTeX RDF	everywhere sensitivity, block sensitivity, sensitive functions, CRCW PRAM complexity, CREW PRAM complexity, CRCW PRAMs
36	Richard Cole 0001, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan 0001, Kunsoo Park, Wojciech Rytter	Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions	FOCS	1993	DBLP DOI BibTeX RDF	optimally fast parallel algorithms, parallel CRCW PRAM algorithms, constant-time text search algorithm, probabilistic string-matching algorithm, pattern matching, preprocessing, time bound, Las-Vegas algorithm
36	Hubert Wagener	Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time	FOCS	1992	DBLP DOI BibTeX RDF	visibility region, subchain hull queries, data structure, convex hull, runtime, simple polygons, simple polygon, CRCW-PRAM, optimal parallel algorithm
36	Shiva Chaudhuri, Jaikumar Radhakrishnan	The Complexity of Parallel Prefix Problems on Small Domains	FOCS	1992	DBLP DOI BibTeX RDF	small domain problems, parallel prefix problems, small domains, prefix maxima, range maxima, parenthesis matching problem, very fast parallel algorithms, complexity, lower bound, chaining, CRCW PRAM model
36	Torben Hagerup, Rajeev Raman	Waste Makes Haste: Tight Bounds for Loose Parallel Sorting	FOCS	1992	DBLP DOI BibTeX RDF	approximate prefix summation problems, loose parallel sorting, input keys, padded sorting, fast randomised CRCW PRAM algorithms, nonstandard OR PRAM, time complexity, random numbers, integer sorting
36	Michael T. Goodrich	Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version)	FOCS	1991	DBLP DOI BibTeX RDF	parallel computational geometry, randomized CRCW PRAM, parallel algorithms, approximation algorithms, processor allocation
36	Jens Lagergren	Efficient Parallel Algorithms for Tree-Decomposition and Related Problems	FOCS	1990	DBLP DOI BibTeX RDF	sequential time complexity, monadic second order properties, linear extended monadic second order extremum problems, concurrent-read, concurrent-write parallel random access machine, enumeration problems, parallel algorithms, graphs, tree-decomposition, tree width, CRCW PRAM
36	Noga Alon, Nimrod Megiddo	Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time	FOCS	1990	DBLP DOI BibTeX RDF	fixed dimension, linear programming problem, probabilistic CRCW PRAM, computational complexity, probability, constant time
36	Charles U. Martel, Ramesh Subramonian, Arvin Park	Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs	FOCS	1990	DBLP DOI BibTeX RDF	synchronous PRAMs, asynchronous behavior, CRCW, concurrent-read, concurrent-write, asynchronous CRCW PRAM, expected work, parallel step, parallel instructions, fail-stop error, parallel random-access-machine, synchronization primitive, simulation technique
36	Vijaya Ramachandran, John H. Reif	An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	graph planarity, open ear decomposition, embedding, graph connectivity, CRCW PRAM, optimal parallel algorithm
36	Samir Khuller, Baruch Schieber	Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)	FOCS	1989	DBLP DOI BibTeX RDF	k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM
36	Elias Dahlhaus, Marek Karpinski	An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	minimal elimination ordering, MEO, arbitrary graph, concurrent-read-concurrent-write parallel random-access machine, parallel algorithm, divide-and-conquer, CRCW PRAM
32	Zhaopeng Li, Kenli Li 0001, Degui Xiao, Lei Yang	An Adaptive Parallel Hierarchical Clustering Algorithm.	HPCC	2007	DBLP DOI BibTeX RDF
32	Limin Xiang, Kazuo Ushijima, Kai Cheng, Jianjun Zhao 0001, Cunwei Lu	O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies.	PDCAT	2004	DBLP DOI BibTeX RDF
32	Amitava Datta	Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.	J. Supercomput.	2002	DBLP DOI BibTeX RDF	reconfigurable pipelined bus, minimum spanning forest, parallel algorithm, graph algorithms, connected components, optical computing, biconnected components
32	Limin Xiang, Kazuo Ushijima	Optimal Parallel Merging Algorithms on BSR.	ISPAN	2000	DBLP DOI BibTeX RDF
32	Limin Xiang, Kazuo Ushijima, Selim G. Akl, Ivan Stojmenovic	An Efficient Implementation for the BROADCAST Instruction of BSR+.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	broadcasting with selective reduction, single selection, multiple selection, general selection, Parallel computation model
32	Babette de Fluiter, Hans L. Bodlaender	Parallel Algorithms for Treewidth Two.	WG	1997	DBLP DOI BibTeX RDF
32	Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko	. Efficient Parallel Algorithms on Distance-Hereditary Graphs.	ICPP	1997	DBLP DOI BibTeX RDF	Steiner tree, PRAM, connected dominating set, clique, distance-hereditary graph
32	Ivan Stojmenovic	Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	parenthesis matching, parallel algorithm, broadcast, sorting, selection, reduction, Binary tree, parallel prefix, tree traversals
32	Hans L. Bodlaender, Babette de Fluiter	Parallel Algorithms for Series Parallel Graphs.	ESA	1996	DBLP DOI BibTeX RDF
32	Svante Carlsson, Jingsen Chen, Christer Mattsson	Heaps with Bits.	ISAAC	1994	DBLP DOI BibTeX RDF
32	Insup Lee 0001, Sanguthevar Rajasekaran	A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation.	CAV	1994	DBLP DOI BibTeX RDF
32	Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman	Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract).	WDAG	1993	DBLP DOI BibTeX RDF
32	Artur Czumaj	An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.	SWAT	1992	DBLP DOI BibTeX RDF
32	Lin Chen 0001	Efficient Deterministic Parallel Algorithms for Integer Sorting.	ICCI	1990	DBLP DOI BibTeX RDF	Resource Tradeoff, Parallel Computation, Lower Bound, Sorting, PRAM, Algorithm Design and Analysis, Prefix Sum, Lexicographic Order, NC
32	Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter	Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.	FSTTCS	1990	DBLP DOI BibTeX RDF
32	Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella	Finding Triconnected Components by Local Replacements.	ICALP	1989	DBLP DOI BibTeX RDF
23	Stefan D. Bruda, Yuanqiao Zhang	The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR.	ISPDC	2008	DBLP DOI BibTeX RDF
23	Mingxian Jin, Johnnie W. Baker	On the Power of the Multiple Associative Computing (MASC) Model Related to That of Reconfigurable Bus-Based Models.	IPDPS	2007	DBLP DOI BibTeX RDF
23	Ryan Williams 0001	Parallelizing time with polynomial circuits.	SPAA	2005	DBLP DOI BibTeX RDF	parallel speedup, circuit complexity, alternation
23	John G. Del Greco, Chandra N. Sekharan, R. Sridhar 0001	Fast Parallel Reordering and Isomorphism Testing of k-Trees.	Algorithmica	2002	DBLP DOI BibTeX RDF	Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree
23	Sanguthevar Rajasekaran, Suneeta Ramaswami	Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane.	Algorithmica	2002	DBLP DOI BibTeX RDF
23	Ambuj Tewari, Utkarsh Srivastava, P. Gupta	A Parallel DFA Minimization Algorithm.	HiPC	2002	DBLP DOI BibTeX RDF
23	George E. Andrews, Arnold Knopfmacher	An Algorithmic Approach to Discovering and Proving q-Series Identities.	Algorithmica	2001	DBLP DOI BibTeX RDF	Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree
23	Weifa Liang, Richard P. Brent, Hong Shen	Fully Dynamic Maintenance of k-Connectivity in Parallel.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms
23	Sidi Mohamed Sedjelmaci	On a Parallel Extended Euclidean Algorithm.	AICCSA	2001	DBLP DOI BibTeX RDF
23	Neelima Gupta, Sumit Chopra, Sandeep Sen	Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.	FSTTCS	2001	DBLP DOI BibTeX RDF
23	Sidi Mohamed Sedjelmaci	On a parallel Lehmer-Euclid GCD algorithm.	ISSAC	2001	DBLP DOI BibTeX RDF
23	Shay Kutten, David Peleg	Deterministic distributed resource discovery (brief announcement).	PODC	2000	DBLP DOI BibTeX RDF
23	Eric Allender, Meena Mahajan	The Complexity of Planarity Testing.	STACS	2000	DBLP DOI BibTeX RDF
23	Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi	A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.	ASIAN	1999	DBLP DOI BibTeX RDF
23	Hiroshi Nagamochi, Toru Hasunuma	An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.	ISAAC	1998	DBLP DOI BibTeX RDF
23	Ka Wong Chong, Edgar A. Ramos	Improved Deterministic Parallel Padded Sorting.	ESA	1998	DBLP DOI BibTeX RDF
23	Jens Gustedt	Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel.	STACS	1998	DBLP DOI BibTeX RDF	parallel algorithms, graph algorithms, minimum spanning tree, graph minors
23	Keqin Li	Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System.	J. Supercomput.	1997	DBLP DOI BibTeX RDF	Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication
23	Biing-Feng Wang, Stephan Olariu	On the Power of the Mesh with Hybrid Buses.	ISPAN	1997	DBLP DOI BibTeX RDF	Mesh with Hybrid Buses, Mesh with Multiple Broadcasting, simulation, parallel algorithms, PRAM, reconfigurable mesh
23	Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki	An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.	ISPAN	1997	DBLP DOI BibTeX RDF	Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree