Search results for "EREW"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
83	Sergio De Agostino	Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW.	SPIRE	2000	DBLP DOI BibTeX RDF	LZ compressed text, PRAM EREW, sliding window compression, LZ2 compression method, LZ1 compression, output string, next character heuristic, identity heuristic, data compression, dictionary, text compression, P-complete, parallel decoding
78	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
71	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
63	Danny Z. Chen	Efficient Geometric Algorithms on the EREW PRAM.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
62	Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran	Efficient Low-Contention Parallel Algorithms.	SPAA	1994	DBLP DOI BibTeX RDF
62	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
58	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
58	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
51	Shahar Alon, Muhammad Erew, Eli Eisenberg	DREAM: a webserver for the identification of editing sites in mature miRNAs using deep sequencing data.	Bioinform.	2015	DBLP DOI BibTeX RDF
50	Vijaya Chung	A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	Algorithmica	2003	DBLP DOI BibTeX RDF
50	Sajal K. Das 0001, Paolo Ferragina	An o(n) Work EREW Parallel Algorithm for Updating MST.	ESA	1994	DBLP DOI BibTeX RDF
50	Shay Halperin, Uri Zwick	An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).	SPAA	1994	DBLP DOI BibTeX RDF
50	Tatsuya Hayashi, Koji Nakano, Stephan Olariu	Optimal Parallel Algorithms for Finding Proximate Points, with Applications.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Proximate points, largest empty circles, pattern recognition, parallel algorithms, image analysis, convex hulls, digital geometry, cellular systems
50	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Optimal Parallel Algorithms for Sparse Graphs.	WG	1990	DBLP DOI BibTeX RDF
45	Hazem M. Bahig	Parallel merging with restriction.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Integer merging, Parallel algorithms, Optimal algorithms, EREW PRAM
45	Yijie Han	Optimal parallel selection.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Parallel algorithms, selection, EREW PRAM
45	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
45	Yijie Han	Optimal parallel selection.	SODA	2003	DBLP BibTeX RDF	parallel algorithms, selection, EREW PRAM
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	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
45	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
45	David M. Nicol, Albert G. Greenberg, Boris D. Lubachevsky	Massively Parallel Algorithms for Trace-Driven Cache Simulations.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	massively parallel algorithms, trace-driven cache simulations, least-recently-used policy, EREW parallel model, algorithm timings, reference-based line replacement policies, least-frequently-used policy, random replacement policy, space overhead, SIMD implementation, parallel algorithms, computational complexity, parallel architectures, trace, buffer storage, program diagnostics, simulation algorithm, MasPar MP-1
45	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
45	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
45	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
38	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
38	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
38	Mauricio Marín	Priority Queue Operations on EREW-PRAM.	Euro-Par	1997	DBLP DOI BibTeX RDF
38	Miroslaw Kutylowski, Krzysztof Lorys	Limitations of the QRQW and EREW PRAM Models.	FSTTCS	1996	DBLP DOI BibTeX RDF
38	Torben Hagerup	Fast Integer Merging on the EREW PRAM.	ICALP	1992	DBLP DOI BibTeX RDF
38	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
37	Luigi Cinque, Sergio De Agostino, Luca Lombardi	Practical Parallel Algorithms for Dictionary Data Compression.	DCC	2009	DBLP DOI BibTeX RDF
37	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
37	Danny Z. Chen, Jinhui Xu 0001	Two-Variable Linear Programming in Parallel.	SWAT	1998	DBLP DOI BibTeX RDF
37	Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan	An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract).	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF
37	Calvin Ching-Yuen Chen, Sajal K. Das 0001	Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees.	ICCI	1990	DBLP DOI BibTeX RDF	Linked list ranking, Breadth-depth search, Optimal speedup, Parallel algorithm, Breadth-first search, Tree traversal
33	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
33	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
33	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
33	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
33	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
33	Vineet Goel, Amar Mukherjee	An optimal parallel algorithm for volume ray casting.	IPPS	1995	DBLP DOI BibTeX RDF	volume ray casting, interactive volume visualization, 3D dataset, O(log n) EREW algorithm, MasPar MPl200, parallel algorithms, computational complexity, parallel processing, volume rendering, ray tracing, data visualisation, frame, processors, computation time, rendering (computer graphics), optimal parallel algorithm
33	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
33	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
33	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
33	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
25	Hazem M. Bahig	Integer merging on EREW PRAM.	Computing	2011	DBLP DOI BibTeX RDF
25	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
25	Jonathan P. Sorenson	A randomized sublinear time parallel GCD algorithm for the EREW PRAM.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
25	Hazem M. Bahig	Merging Data Records on EREW PRAM.	ICA3PP (2)	2010	DBLP DOI BibTeX RDF
25	Jonathan P. Sorenson	A Sublinear Time Parallel GCD Algorithm for the EREW PRAM	CoRR	2009	DBLP BibTeX RDF
25	Marc Hofmann, Erricos John Kontoghiorghes	Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM.	Parallel Comput.	2006	DBLP DOI BibTeX RDF
25	Sergio De Agostino	Almost work-optimal pram erew decoders of LZ compressed text.	Parallel Process. Lett.	2004	DBLP DOI BibTeX RDF
25	Sergio De Agostino	Almost Work-Optimal PRAM EREW Decoders of LZ Compressed Text.	DCC	2003	DBLP DOI BibTeX RDF
25	Shay Halperin, Uri Zwick	Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.	J. Algorithms	2001	DBLP DOI BibTeX RDF
25	Erricos John Kontoghiorghes	Parallel Givens sequences for solving the general linear model on a EREW PRAM.	Parallel Algorithms Appl.	2000	DBLP DOI BibTeX RDF
25	Sarnath Ramnath, Venkatesh Raman 0001	Selecting Small Ranks in EREW PRAM.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
25	Sajal K. Das 0001, Paolo Ferragina	An EREW PRAM Algorithm for Updating Minimum Spanning Trees.	Parallel Process. Lett.	1999	DBLP DOI BibTeX RDF
25	David R. Karger, Noam Nisan, Michal Parnas	Fast Connected Components Algorithms for the EREW PRAM.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
25	Anders Dessmark, Andrzej Lingas	Improved Bounds for Integer Sorting in the EREW PRAM Model.	J. Parallel Distributed Comput.	1998	DBLP DOI BibTeX RDF
25	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
25	H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee	An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
25	Torben Hagerup, Miroslaw Kutylowski	Fast Integer Merging on the EREW PRAM.	Algorithmica	1997	DBLP DOI BibTeX RDF
25	Hong Shen 0001	Optimal Parallel Multiselection on EREW PRAM.	Parallel Comput.	1997	DBLP DOI BibTeX RDF
25	Paul Beame, Faith E. Fich, Rakesh K. Sinha	Separating the Power of EREW and CREW PRAMs with Small Communication Width.	Inf. Comput.	1997	DBLP DOI BibTeX RDF
25	Chung Keung Poon, Vijaya Ramachandran	A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.	ISAAC	1997	DBLP DOI BibTeX RDF
25	Krzysztof Diks, Andrzej Pelc	Reliable Computations on Faulty EREW PRAM.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
25	Shay Halperin, Uri Zwick	An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
25	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
25	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
25	Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde	Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.	Comput. Complex.	1995	DBLP DOI BibTeX RDF
25	Ville Leppänen	On Implementing EREW Work-Optimally on Mesh of Trees.	J. Univers. Comput. Sci.	1995	DBLP DOI BibTeX RDF
25	Rong Lin, Stephan Olariu	A Cost-optimal Erew Breadth-first Algorithm for Ordered Trees, with Applications.	Parallel Algorithms Appl.	1995	DBLP DOI BibTeX RDF
25	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
25	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
25	Lisa Higham, Eric Schenk	Maintaining B-Trees on an EREW PRAM.	J. Parallel Distributed Comput.	1994	DBLP DOI BibTeX RDF
25	Weixiong Zhang, Richard E. Korf	Parallel Heap Operations on an EREW PRAM.	J. Parallel Distributed Comput.	1994	DBLP DOI BibTeX RDF
25	Theodore Brown, Renbing Xiong	An Erew-pram Multiple Searching and Merging Algorithm.	Parallel Algorithms Appl.	1994	DBLP DOI BibTeX RDF
25	Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang	An Efficient Erew Algorithm for Minimum Path Cover and Hamiltonicity on Cographs.	Parallel Algorithms Appl.	1994	DBLP DOI BibTeX RDF
25	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
25	Paul Beame, Faith E. Fich, Rakesh K. Sinha	Separating the Power of EREW and CREW PRAMs with Small Communication Width.	WADS	1993	DBLP DOI BibTeX RDF
25	Weixiong Zhang, Richard E. Korf	Parallel Heap Operations on EREW PRAM: Summary of Results.	IPPS	1992	DBLP DOI BibTeX RDF
25	David R. Karger, Noam Nisan, Michal Parnas	Fast Connected Components Algorithms for the EREW PRAM.	SPAA	1992	DBLP DOI BibTeX RDF
25	Its'hak Dinstein, Gad M. Landau, Gideon Guy	Parallel (pram erew) algorithms for contour-based 2D shape recognition.	Pattern Recognit.	1991	DBLP DOI BibTeX RDF
25	Weixiong Zhang, Nageswara S. V. Rao	Optimal Parallel Quicksort on Erew Pram.	BIT	1991	DBLP DOI BibTeX RDF
25	Hillel Gazit	Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs.	IPPS	1991	DBLP DOI BibTeX RDF
25	Sushil K. Prasad, Narsingh Deo	Two EREW Algorithms for Parentheses Matching.	IPPS	1991	DBLP DOI BibTeX RDF
25	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
25	Ingo Wegener	Efficient Simulation of Circuits by Erew Prams.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
25	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
25	Torben Hagerup, Christine Rüb	Optimal Merging and Sorting on the Erew Pram.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
25	Eli Gafni, Joseph Naor, Prabhakar Ragde	On Separating the Erew and Crew Pram Models.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
25	Wai Wan Tsang, Tak Wah Lam, Francis Y. L. Chin	An Optimal EREW Parallel Algorithm for Parenthesis Matching.	ICPP (3)	1989	DBLP BibTeX RDF
25	Luigi Cinque, Sergio De Agostino	A Parallel Decoder for Lossless Image Compression by Block Matching.	DCC	2007	DBLP DOI BibTeX RDF
25	Biing-Feng Wang	Finding r-Dominating Sets and p-Centers of Trees in Parallel.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
25	Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios	An Optimal Parallel Co-Connectivity Algorithm.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
25	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
25	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
25	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
25	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