Search results for "EREW PRAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST. (PDF / PS)	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
3	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
3	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
2	Hazem M. Bahig	Parallel merging with restriction.	The Journal of Supercomputing	2008	DBLP DOI BibTeX RDF	Integer merging, Parallel algorithms, Optimal algorithms, EREW PRAM
2	Yijie Han	Optimal parallel selection.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Parallel algorithms, selection, EREW PRAM
2	Vijaya Chung	A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	Algorithmica	2003	DBLP DOI BibTeX RDF
2	Yijie Han	Optimal parallel selection.	SODA	2003	DBLP DOI BibTeX RDF	parallel algorithms, selection, EREW PRAM
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	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
2	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
2	Carla Denise Castanho, Wei Chen 0003, Koichi Wada, Akihiro Fujiwara	Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM.	COCOON	2001	DBLP DOI BibTeX RDF
2	Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi	Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.	IEEE Trans. Parallel Distrib. Syst.	2001	DBLP DOI BibTeX RDF	Parallel algorithms, trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique
2	Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu	Parallel Algorithms for the Tree Bisector Problem and Applications. (PDF / PS)	ICPP	1999	DBLP DOI BibTeX RDF	Trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique
2	Mauricio Marín	Priority Queue Operations on EREW-PRAM.	Euro-Par	1997	DBLP DOI BibTeX RDF
2	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
2	Miroslaw Kutylowski, Krzysztof Lorys	Limitations of the QRQW and EREW PRAM Models.	FSTTCS	1996	DBLP DOI BibTeX RDF
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	Lin Chen	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
2	Danny Z. Chen	Efficient Geometric Algorithms on the EREW PRAM.	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF
2	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
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	Sushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen	Efficient EREW PRAM Algorithms for Parentheses-Matching.	IEEE Trans. Parallel Distrib. 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
2	Shay Halperin, Uri Zwick	An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).	SPAA	1994	DBLP DOI BibTeX RDF
2	Torben Hagerup	Fast Integer Merging on the EREW PRAM.	ICALP	1992	DBLP DOI BibTeX RDF
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
2	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
2	Selim G. Akl, Henk Meijer	Parallel Binary Search.	IEEE Trans. Parallel Distrib. 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
2	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	Hazem M. Bahig	Integer merging on EREW PRAM.	Computing	2011	DBLP DOI BibTeX RDF
1	Khaled A. Fathy, Hazem M. Bahig, Hatem M. Bahig, A. A. Ragb	Binary Addition Chain on EREW PRAM.	ICA3PP	2011	DBLP DOI BibTeX RDF
1	Jonathan P. Sorenson	A randomized sublinear time parallel GCD algorithm for the EREW PRAM.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Hazem M. Bahig	Merging Data Records on EREW PRAM.	ICA3PP	2010	DBLP DOI BibTeX RDF
1	Jonathan P. Sorenson	A Sublinear Time Parallel GCD Algorithm for the EREW PRAM	CoRR	2009	DBLP BibTeX RDF
1	Saverio Caminiti, Rossella Petreschi	Parallel Algorithms for Dandelion-Like Codes.	ICCS	2009	DBLP DOI BibTeX RDF
1	Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu	Smallest Bipartite Bridge-Connectivity Augmentation.	Algorithmica	2009	DBLP DOI BibTeX RDF	2-edge-connectivity, Bridge-connectivity, Bipartite graph augmentation, Data security
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	Benoît Hudson, Gary L. Miller, Todd Phillips	Sparse parallel Delaunay mesh refinement.	SPAA	2007	DBLP DOI BibTeX RDF	computational geometry, mesh generation, shared-memory parallelism
1	Hazem M. Bahig, Hatem M. Bahig	Optimal Parallel Merging by Counting.	ITNG	2007	DBLP DOI BibTeX RDF
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	Marc Hofmann, Erricos John Kontoghiorghes	Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM.	Parallel Computing	2006	DBLP DOI BibTeX RDF
1	Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt	Linear work suffix array construction.	J. ACM	2006	DBLP DOI BibTeX RDF	Difference cover, suffix array, external memory algorithms
1	Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis	On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer.	ISPA	2006	DBLP DOI BibTeX RDF
1	Hazem M. Bahig, Sameh S. Daoud	Practical Integer Sorting on Shared Memory.	HPCC	2005	DBLP DOI BibTeX RDF
1	Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian	Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network.	ISAAC	2005	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	Aaron Windsor	An NC algorithm for finding a maximal acyclic set in a graph.	SPAA	2004	DBLP DOI BibTeX RDF	hypergraph algorithms, maximal acyclic set, maximal forest, graph algorithms, NC algorithms
1	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
1	Biing-Feng Wang	Finding r-Dominating Sets and p-Centers of Trees in Parallel.	IEEE Trans. Parallel Distrib. Syst.	2004	DBLP DOI BibTeX RDF
1	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
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	Marina L. Gavrilova	Empirical Studies of Optimization Techniques in the Event-Driven Simulation of Mechanically Alloyed Materials.	The Journal of Supercomputing	2004	DBLP DOI BibTeX RDF	collision detection algorithms, mechanically alloyed materials, parallel processing, computer simulation, optimization problems
1	Juha Kärkkäinen, Peter Sanders	Simple Linear Work Suffix Array Construction.	ICALP	2003	DBLP DOI BibTeX RDF
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	Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu	Efficient Parallel Algorithms for Planar st-Graphs.	Algorithmica	2003	DBLP DOI BibTeX RDF
1	Heejin Park, Kunsoo Park, Yookun Cho	Deleting Keys of B-trees in Parallel. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF	balanced search trees, dictionary operations, parallel algorithms, B-trees
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	Sun-Yuan Hsieh	An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs.	IEEE Trans. Parallel Distrib. Syst.	2002	DBLP DOI BibTeX RDF	the efficient domination problem, binary tree contraction technique, Parallel algorithm, PRAM, distance-hereditary graphs
1	Harold N. Gabow, San Skulrattanakulchai	Coloring Algorithms on Subcubic Graphs.	COCOON	2002	DBLP DOI BibTeX RDF
1	Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko	Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs.	COCOON	2002	DBLP DOI BibTeX RDF
1	Shay Halperin, Uri Zwick	Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	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
1	Erricos John Kontoghiorghes	Parallel Givens sequences for solving the general linear model on a EREW PRAM.	Parallel Algorithms Appl.	2000	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	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
1	Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi	A Simple Parallel Algorithm to Draw Cubic Graphs.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	computer graphics. visualization, parallel algorithms, layout, orthogonal drawing, Cubic graphs
1	Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang	Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique
1	Hong-Chung Chen, Yue-Li Wang	An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
1	Sarnath Ramnath, Venkatesh Raman	Selecting Small Ranks in EREW PRAM.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
1	Sajal K. Das, Paolo Ferragina	An EREW PRAM Algorithm for Updating Minimum Spanning Trees.	Parallel Processing Letters	1999	DBLP BibTeX RDF
1	David R. Karger, Noam Nisan, Michal Parnas	Fast Connected Components Algorithms for the EREW PRAM.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Koji Nakano, Stephan Olariu, Albert Y. Zomaya	A Time-Optimal Solution for the Path Cover Problem on Cographs. (PDF / PS)	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
1	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
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	Wei Chen 0003, Koichi Wada	On Computing the Upper Envelope of Segments in Parallel. (PDF / PS)	ICPP	1998	DBLP DOI BibTeX RDF
1	Tatsuya Hayashi, Koji Nakano, Stephan Olariu	Work-Time Optimal k-Merge Algorithms on the PRAM.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	work-time optimal algorithms, information retrieval, parallel algorithms, databases, query processing, sorting, Merging
1	Biing-Feng Wang	Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	Trees, cores, centers, tree contraction, the Euler-tour technique
1	Danny Z. Chen, Jinhui Xu	Two-Variable Linear Programming in Parallel.	SWAT	1998	DBLP DOI BibTeX RDF
1	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
1	Torben Hagerup, Miroslaw Kutylowski	Fast Integer Merging on the EREW PRAM.	Algorithmica	1997	DBLP DOI BibTeX RDF
1	Hong Shen	Optimal Parallel Multiselection on EREW PRAM.	Parallel Computing	1997	DBLP DOI BibTeX RDF
1	Chung Keung Poon, Vijaya Ramachandran	A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	ISAAC	1997	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	Lin Chen	Optimal Computation of Shortest Paths on Doubly Convex Bipartite Graphs. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF
1	Yoojin Chung, Kunsoo Park, Yookun Cho	Parallel Maximum Matching Algorithms in Interval Graphs. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF
1	Shan-Chyun Ku, Wei Kuan Shih, Biing-Feng Wang	Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	Trees, cores, tree contraction, the Euler-tour technique
1	Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara	A Parallel Algorithm for Weighted Distance Transforms. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF
1	Yue-Li Wang, Hon-Chan Chen, Wei-Kai Liu	A Parallel Algorithm for Constructing a Labeled Tree.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	Cayley's tree formula, dominance counting problem, Prüfer mapping, parallel algorithms, labeled trees
1	Babette de Fluiter, Hans L. Bodlaender	Parallel Algorithms for Treewidth Two.	WG	1997	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Edgar A. Ramos	Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming.	Discrete & Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Krzysztof Diks, Andrzej Pelc	Reliable Computations on Faulty EREW PRAM.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
1	G. Sajith, Sanjeev Saxena	Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.	Discrete Applied Mathematics	1996	DBLP DOI BibTeX RDF
1	Shay Halperin, Uri Zwick	An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
1	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
1	Bala Ravikumar, X. Xiong	A Parallel Algorithm for Minimization of Finite Automata. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	parallel algorithms, automata, minimization
1	Ivan Stojmenovic	Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	parenthesis matching, parallel algorithm, broadcast, sorting, selection, reduction, Binary tree, parallel prefix, tree traversals
1	Hans L. Bodlaender, Babette de Fluiter	Parallel Algorithms for Series Parallel Graphs.	ESA	1996	DBLP DOI BibTeX RDF
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	Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys	Fast Generation of Random Permutations via Networks Simulation.	ESA	1996	DBLP DOI BibTeX RDF