Search results for "EREW-PRAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
137	Oscar H. Ibarra, Hui Wang 0008, Tao Jiang 0001	Efficient parallel algorithms for solving set recurrence equations and applications.	SPDP	1990	DBLP DOI BibTeX RDF
136	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs.	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model
128	Danny Z. Chen	Efficient Geometric Algorithms on the EREW PRAM.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
123	Robert Cypher, Jorge L. C. Sanz, L. Snyder	An EREW PRAM Algorithm for Image Component Labeling.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	EREW PRAM algorithm, image component labeling, synchronous fine-grained shared-memory model, exclusive-read exclusive-write parallel RAM, computer vision, computer vision, parallel algorithm, parallel algorithms, computational complexity, parallel processing, binary images, random-access storage, mesh-connected computers
103	Miroslaw Kutylowski, Krzysztof Lorys	Limitations of the QRQW and EREW PRAM Models.	FSTTCS	1996	DBLP DOI BibTeX RDF
101	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
100	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
98	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
97	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Optimal Parallel Algorithms for Sparse Graphs.	WG	1990	DBLP DOI BibTeX RDF
89	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
87	Vijaya Chung	A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	Algorithmica	2003	DBLP DOI BibTeX RDF
87	Shay Halperin, Uri Zwick	An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).	SPAA	1994	DBLP DOI BibTeX RDF
79	Hazem M. Bahig	Parallel merging with restriction.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Integer merging, Parallel algorithms, Optimal algorithms, EREW PRAM
79	Yijie Han	Optimal parallel selection.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Parallel algorithms, selection, EREW PRAM
79	Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer	Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	Computer vision, parallel algorithm, image processing, distance transform, Euclidean distance, three-dimension, EREW PRAM model
79	Yijie Han	Optimal parallel selection.	SODA	2003	DBLP BibTeX RDF	parallel algorithms, selection, EREW PRAM
79	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
79	Selim G. Akl, Henk Meijer	Parallel Binary Search.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	nondecreasing order, parallel merging algorithm, parallel algorithms, computational complexity, search problems, parallel random-access machine, binary search, cost optimality, EREW PRAM
79	Constantine N. K. Osiakwan, Selim G. Akl	Optimal Parallel Algorithms for b-Matchings in Trees.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF	postorder numbering, parallel algorithm, tree, matching, maximum independent set, EREW PRAM, b - matching, minimum set cover
79	Sushil K. Prasad, Sajal K. Das 0001, Calvin Ching-Yuen Chen	Efficient EREW PRAM Algorithms for Parentheses-Matching.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	EREW PRAM algorithms, parentheses-matching, polylog-time parallel algorithms, exclusive-read and exclusive-write, parallelrandom-access machine, input string, working space, time-optimal algorithms, pattern recognition, parallel algorithms, computational complexity, data structures, data structures, parallel machines, time complexity, arrays, space complexity, random-access storage, PRAM model
75	Sun-Yuan Hsieh	Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
75	Mauricio Marín	Priority Queue Operations on EREW-PRAM.	Euro-Par	1997	DBLP DOI BibTeX RDF
67	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
66	Danny Z. Chen, Jinhui Xu 0001	Two-Variable Linear Programming in Parallel.	SWAT	1998	DBLP DOI BibTeX RDF
65	Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer	Fast Computation of the 3-D Euclidean Distance Transform on the EREW PRAM Model.	ICPP	2001	DBLP DOI BibTeX RDF
65	Carla Denise Castanho, Wei Chen 0003, Koichi Wada 0001, Akihiro Fujiwara	Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM.	COCOON	2001	DBLP DOI BibTeX RDF
65	Torben Hagerup	Fast Integer Merging on the EREW PRAM.	ICALP	1992	DBLP DOI BibTeX RDF
63	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
63	Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc	Fast Deterministic Simulation of Computations on Faulty Parallel Machines.	ESA	1995	DBLP DOI BibTeX RDF
63	Lin Chen 0001	Optimal Circular Arc Representations.	Euro-Par	1995	DBLP DOI BibTeX RDF
63	Susanne Albers, Torben Hagerup	Improved Parallel Integer Sorting Without Concurrent Writing.	SODA	1992	DBLP BibTeX RDF
57	Wei Chen 0003, Koichi Wada 0001	On Computing the Upper Envelope of Segments in Parallel.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	upper envelope, Davenport-Schinzel sequence, Computational geometry, visibility, convex hull, EREW PRAM model
57	Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu	Parallel Algorithms for the Tree Bisector Problem and Applications.	ICPP	1999	DBLP DOI BibTeX RDF	Trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique
57	Sung Kwon Kim	An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.	ISPAN	1997	DBLP DOI BibTeX RDF	planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable
57	Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001	A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking.	IPPS	1996	DBLP DOI BibTeX RDF	parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model
57	Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng	Recognizing depth-first-search trees in parallel.	IPPS	1995	DBLP DOI BibTeX RDF	depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model
57	Stephan Olariu, James L. Schwing, Jingyuan Zhang	Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	family of intervals, cost-optimal parallel algorithms, O(log n) time, scheduling, parallel algorithms, parallel algorithms, computational complexity, EREW-PRAM model, computational tools
57	Rong Lin, Stephan Olariu	A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem.	ICCI	1991	DBLP DOI BibTeX RDF	parallel algorithms, EREW-PRAM, list ranking, lowest common ancestors, ordered trees, Euler tour
53	Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara	A Parallel Algorithm for Weighted Distance Transforms.	IPPS	1997	DBLP DOI BibTeX RDF
53	Hans L. Bodlaender, Torben Hagerup	Parallel Algorithms with Optimal Speedup for Bounded Treewidth.	ICALP	1995	DBLP DOI BibTeX RDF
50	Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys	Fast Generation of Random Permutations via Networks Simulation.	ESA	1996	DBLP DOI BibTeX RDF
50	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
44	Biing-Feng Wang	Finding r-Dominating Sets and p-Centers of Trees in Parallel.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
44	Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios	An Optimal Parallel Co-Connectivity Algorithm.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
44	Raymond Greenlaw, Charles Shipley, James Wogulis	Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management System.	PARELEC	2000	DBLP DOI BibTeX RDF
44	Biing-Feng Wang	Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Trees, cores, centers, tree contraction, the Euler-tour technique
44	Thomas H. Spencer	Time-work tradeoffs for parallel algorithms.	J. ACM	1997	DBLP DOI BibTeX RDF	nearby lists, shortest path, PRAM, transitive closure, breadth first search, topological sort
44	Danny Z. Chen, Wei Chen 0003, Koichi Wada 0001, Kimio Kawaguchi	Parallel Algorithms for Partitioning Sorted Sets and Related Problems.	ESA	1996	DBLP DOI BibTeX RDF
44	Ernst W. Mayr, Hans Stadtherr	Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
44	Danny Z. Chen	Efficient Parallel Binary Search on Sorted Arrays, with Applications.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
44	Anil Maheshwari, Andrzej Lingas	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.	STACS	1994	DBLP DOI BibTeX RDF
44	Ling Tony Chen, Larry S. Davis, Clyde P. Kruskal	Efficient Parallel Processing of Image Contours.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	EREW model, CREW PRAM model, segmented scan operations, computer vision, computer vision, parallel algorithms, parallel algorithms, computational complexity, image processing, parallel processing, parallel processing, hypercube, hypercube networks, image contours, Connection Machine
44	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
44	Jyrki Katajainen, Christos Levcopoulos, Ola Petersson	Space-Efficient Parallel Merging.	PARLE	1992	DBLP DOI BibTeX RDF	Direct Connection Machine, merging, PRAM, space efficiency
44	Takayoshi Shoudai	Using Maximal Independent Sets to Solve Problems in Parallel.	WG	1991	DBLP DOI BibTeX RDF
44	Vijaya Ramachandran, Li-Chung Wang	Parallel algorithm and complexity results for telephone link simulation.	SPDP	1991	DBLP DOI BibTeX RDF
44	Hazem M. Bahig	Integer merging on EREW PRAM.	Computing	2011	DBLP DOI BibTeX RDF
44	Khaled A. Fathy, Hazem M. Bahig, Hatem M. Bahig, A. A. Ragb	Binary Addition Chain on EREW PRAM.	ICA3PP (2)	2011	DBLP DOI BibTeX RDF
44	Jonathan P. Sorenson	A randomized sublinear time parallel GCD algorithm for the EREW PRAM.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
44	Hazem M. Bahig	Merging Data Records on EREW PRAM.	ICA3PP (2)	2010	DBLP DOI BibTeX RDF
44	Jonathan P. Sorenson	A Sublinear Time Parallel GCD Algorithm for the EREW PRAM	CoRR	2009	DBLP BibTeX RDF
44	Marc Hofmann, Erricos John Kontoghiorghes	Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM.	Parallel Comput.	2006	DBLP DOI BibTeX RDF
44	Shay Halperin, Uri Zwick	Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.	J. Algorithms	2001	DBLP DOI BibTeX RDF
44	Erricos John Kontoghiorghes	Parallel Givens sequences for solving the general linear model on a EREW PRAM.	Parallel Algorithms Appl.	2000	DBLP DOI BibTeX RDF
44	Sarnath Ramnath, Venkatesh Raman 0001	Selecting Small Ranks in EREW PRAM.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
44	Sajal K. Das 0001, Paolo Ferragina	An EREW PRAM Algorithm for Updating Minimum Spanning Trees.	Parallel Process. Lett.	1999	DBLP DOI BibTeX RDF
44	David R. Karger, Noam Nisan, Michal Parnas	Fast Connected Components Algorithms for the EREW PRAM.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
44	Anders Dessmark, Andrzej Lingas	Improved Bounds for Integer Sorting in the EREW PRAM Model.	J. Parallel Distributed Comput.	1998	DBLP DOI BibTeX RDF
44	Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha	An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
44	Torben Hagerup, Miroslaw Kutylowski	Fast Integer Merging on the EREW PRAM.	Algorithmica	1997	DBLP DOI BibTeX RDF
44	Hong Shen 0001	Optimal Parallel Multiselection on EREW PRAM.	Parallel Comput.	1997	DBLP DOI BibTeX RDF
44	Chung Keung Poon, Vijaya Ramachandran	A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	ISAAC	1997	DBLP DOI BibTeX RDF
44	Krzysztof Diks, Andrzej Pelc	Reliable Computations on Faulty EREW PRAM.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
44	Shay Halperin, Uri Zwick	An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
44	G. Sajith, Sanjeev Saxena	Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.	Discret. Appl. Math.	1996	DBLP DOI BibTeX RDF
44	Shay Halperin, Uri Zwick	Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems.	SODA	1996	DBLP DOI BibTeX RDF
44	Ka Wong Chong, Tak Wah Lam	Finding Connected Components in O(log n log log n) Time on the EREW PRAM.	J. Algorithms	1995	DBLP DOI BibTeX RDF
44	Sajal K. Das 0001, Ranette H. Halverson	Simple Deterministic and Randomized Algorithms for Linked List Ranking on the Erew Pram Model.	Parallel Process. Lett.	1994	DBLP DOI BibTeX RDF
44	Lisa Higham, Eric Schenk	Maintaining B-Trees on an EREW PRAM.	J. Parallel Distributed Comput.	1994	DBLP DOI BibTeX RDF
44	Weixiong Zhang, Richard E. Korf	Parallel Heap Operations on an EREW PRAM.	J. Parallel Distributed Comput.	1994	DBLP DOI BibTeX RDF
44	Theodore Brown, Renbing Xiong	An Erew-pram Multiple Searching and Merging Algorithm.	Parallel Algorithms Appl.	1994	DBLP DOI BibTeX RDF
44	Ka Wong Chong, Tak Wah Lam	Finding Connected Components in O(log n log log n) Time on the EREW PRAM.	SODA	1993	DBLP DOI BibTeX RDF
44	Weixiong Zhang, Richard E. Korf	Parallel Heap Operations on EREW PRAM: Summary of Results.	IPPS	1992	DBLP DOI BibTeX RDF
44	David R. Karger, Noam Nisan, Michal Parnas	Fast Connected Components Algorithms for the EREW PRAM.	SPAA	1992	DBLP DOI BibTeX RDF
44	Weixiong Zhang, Nageswara S. V. Rao	Optimal Parallel Quicksort on Erew Pram.	BIT	1991	DBLP DOI BibTeX RDF
44	Calvin Ching-Yuen Chen, Sajal K. Das 0001	A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM.	IPPS	1991	DBLP DOI BibTeX RDF
44	Its'hak Dinstein, Gad M. Landau	Parallel algorithms for contour extraction and coding on an EREW PRAM computer.	Pattern Recognit. Lett.	1990	DBLP DOI BibTeX RDF
44	Torben Hagerup, Christine Rüb	Optimal Merging and Sorting on the Erew Pram.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
41	Michael T. Goodrich, Edgar A. Ramos	Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming.	Discret. Comput. Geom.	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	Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann	Shared Memory Simulations with Triple-Logarithmic Delay.	ESA	1995	DBLP DOI BibTeX RDF
41	Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis	Computing Shortest Paths and Distances in Planar Graphs.	ICALP	1991	DBLP DOI BibTeX RDF
35	Ka Wong Chong, Yijie Han, Tak Wah Lam	Concurrent threads and optimal parallel minimum spanning trees algorithm.	J. ACM	2001	DBLP DOI BibTeX RDF	parallel algorithms, minimum spanning trees, connected components, EREW PRAM
35	Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos	Parallel Algorithms for Higher-Dimensional Convex Hulls	FOCS	1994	DBLP DOI BibTeX RDF	higher-dimensional convex hulls, weakest shared-memory model, 3-dimensional methods, parallel algorithms, convex hulls, EREW PRAM, output-sensitive
35	Sajal K. Das 0001, Wen-Bing Horng	Managing a Parallel Heap Efficiently.	PARLE (1)	1991	DBLP DOI BibTeX RDF	optimal speedup, parallel algorithm, data structure, priority queue, Algorithm analysis, heap, EREW PRAM
35	Gary L. Miller, Joseph Naor	Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	multiple sources, planar network, exclusive-read-exclusive-write parallel random-access machine, edge capacities, lower bounds, time complexity, planar graphs, upper bounds, face, maximum flow, EREW PRAM, demand, sinks
34	Sajal K. Das 0001, Paolo Ferragina	An o(n) Work EREW Parallel Algorithm for Updating MST.	ESA	1994	DBLP DOI BibTeX RDF
31	Guojing Cong, David A. Bader	The Euler Tour Technique and Parallel Rooted Spanning Tree.	ICPP	2004	DBLP DOI BibTeX RDF	High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour
31	Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu	Efficient Parallel Algorithms for Planar st-Graphs.	Algorithmica	2003	DBLP DOI BibTeX RDF
31	Sun-Yuan Hsieh	An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	the efficient domination problem, binary tree contraction technique, Parallel algorithm, PRAM, distance-hereditary graphs