Search results for "EREW PRAM model"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer	Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array.	IEEE Trans. Parallel Distrib. Syst.	2003	DBLP DOI BibTeX RDF	Computer vision, parallel algorithm, image processing, distance transform, Euclidean distance, three-dimension, EREW PRAM model
2	Yu-Hua Lee, Shi-Jinn Horng	Fast parallel chessboard distance transform algorithms. (PDF / PS)	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
2	Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das	A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. (PDF / PS)	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
2	Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng	Recognizing depth-first-search trees in parallel. (PDF / PS)	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
2	Stephan Olariu, James L. Schwing, Jingyuan Zhang	Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals.	IEEE Trans. Parallel Distrib. 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
1	Jalal A. Nasiri, M. Amir Moulavi, Sepideh Nazemi Gelyan, Hossein Deldari, Hadi Sadoghi Yazdi, A. Eshghi Shargh	An Efficient Parallel Eye Detection Algorithm on Facial Color Images.	SNPD	2008	DBLP DOI BibTeX RDF	Facial Color Images, Parallel Algorithm, PRAM, Eye Detection
1	Yijie Han	Optimal parallel selection.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Parallel algorithms, selection, EREW PRAM
1	Yamin Li, Shietung Peng, Wanming Chu	Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications.	PDCAT	2007	DBLP DOI BibTeX RDF
1	Kenli Li, Renfa Li, Lei Yang, Yantao Zhou	A Parallel O(n27n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems.	NPC	2005	DBLP DOI BibTeX RDF
1	Saverio Caminiti, Irene Finocchi, Rossella Petreschi	A Unified Approach to Coding Labeled Trees.	LATIN	2004	DBLP DOI BibTeX RDF
1	Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios	An Optimal Parallel Co-Connectivity Algorithm.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
1	Yijie Han	Optimal parallel selection.	SODA	2003	DBLP DOI BibTeX RDF	parallel algorithms, selection, EREW PRAM
1	Abul Kashem, M. Ziaur Rahman	An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees.	ISAAC	2003	DBLP DOI BibTeX RDF	Ordered coloring, Separator-tree, Vertex-ranking, Parallel algorithm, Tree
1	Wei Chen 0003, Koichi Wada	On Computing the Upper Envelope of Segments in Parallel.	IEEE Trans. Parallel Distrib. Syst.	2002	DBLP DOI BibTeX RDF	upper envelope, Davenport-Schinzel sequence, Computational geometry, visibility, convex hull, EREW PRAM model
1	Jie Wu, Stephan Olariu	On Cost-Optimal Merge of Two Intransitive Sorted Sequences. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF	sorting, merging, PRAM, Hamiltonian path, tournament
1	Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer	Fast Computation of the 3-D Euclidean Distance Transform on the EREW PRAM Model. (PDF / PS)	ICPP	2001	DBLP DOI BibTeX RDF
1	Jie Wu	On Sorting an Intransitive Total Ordered Set Using Semi-Heap. (PDF / PS)	IPDPS	2000	DBLP DOI BibTeX RDF	Data structure, sorting, directed graph, Hamiltonian path, heap, total order
1	Anders Dessmark, Andrzej Lingas	Improved Bounds for Integer Sorting in the EREW PRAM Model.	J. Parallel Distrib. Comput.	1998	DBLP DOI BibTeX RDF
1	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
1	Danny Z. Chen, Wei Chen 0003, Koichi Wada, Kimio Kawaguchi	Parallel Algorithms for Partitioning Sorted Sets and Related Problems.	ESA	1996	DBLP DOI BibTeX RDF
1	Anssi Kautonen, Ville Leppänen, Martti Penttonen	Simulations of PRAM on Complete Optical Networks.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
1	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs. (PDF / PS)	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
1	Yossi Matias, Uzi Vishkin	A note on reducing parallel model simulations to integer sorting. (PDF / PS)	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
1	Shiva Chaudhuri, Christos D. Zaroliagis	Optimal Parallel Shortest Paths in Small Treewidth Digraphs.	ESA	1995	DBLP DOI BibTeX RDF
1	Sajal K. Das, Ranette H. Halverson	Simple Deterministic and Randomized Algorithms for Linked List Ranking on the Erew Pram Model.	Parallel Processing Letters	1994	DBLP BibTeX RDF
1	Joseph Cheriyan, John H. Reif	Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity.	SODA	1992	DBLP DOI BibTeX RDF
1	Sajal K. Das, Calvin Ching-Yuen Chen	Efficient Parallel Algorithms on Interval Graphs.	PARLE	1992	DBLP DOI BibTeX RDF
1	Rong Lin, Stephan Olariu	An optimal parallel matching algorithm for cographs.	SPDP	1991	DBLP DOI BibTeX RDF
1	Ying Zhang, Alan K. Mackworth	Parallel and distributed algorithms for finite constraint satisfaction problems.	SPDP	1991	DBLP DOI BibTeX RDF
1	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
1	Rong Lin, Stephan Olariu	On the parallel recognition of some tree-representable graphs.	SPDP	1990	DBLP DOI BibTeX RDF
1	Constantine N. K. Osiakwan, Selim G. Akl	The maximum weight perfect matching problem for complete weighted graphs is in PC.	SPDP	1990	DBLP DOI BibTeX RDF
1	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
1	Christos Levcopoulos	On Optimal Parallel Algorithm for Sorting Presorted Files.	FSTTCS	1988	DBLP DOI BibTeX RDF