Search results for "PRAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
9	Peter Damaschke	Searching for a Monotone Function by Independent Threshold Queries.	ISAAC	1995	DBLP DOI BibTeX RDF
9	Shiva Chaudhuri, Christos D. Zaroliagis	Optimal Parallel Shortest Paths in Small Treewidth Digraphs.	ESA	1995	DBLP DOI BibTeX RDF
9	Peter Damaschke	An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.	ESA	1995	DBLP DOI BibTeX RDF
9	Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade	Tight Bounds on Parallel List Marking.	Euro-Par	1995	DBLP DOI BibTeX RDF
9	Tadao Takaoka	Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem.	WG	1995	DBLP DOI BibTeX RDF
9	Zhi-Zhong Chen, Xin He	NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems.	WG	1995	DBLP DOI BibTeX RDF
9	Jens Gustedt, Michel Morvan, Laurent Viennot	A Compact Data Structure and Parallel Algorithms for Permutation Graphs.	WG	1995	DBLP DOI BibTeX RDF
9	Lan Yang, Lan Jin	Integrating parallel algorithm design with parallel machine models.	SIGCSE	1995	DBLP DOI BibTeX RDF
9	Peter Damaschke	Line Segmentation of Digital Curves in Parallel.	STACS	1995	DBLP DOI BibTeX RDF
9	Shun-Shii Lin	Constant-time algorithms for the channel assignment problem on processor arrays with reconfigurable bus systems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
9	Noga Alon, Nimrod Megiddo	Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time.	J. ACM	1994	DBLP DOI BibTeX RDF	multidimensional search, parallel computation, computational geometry, linear programming, probabilistic computation
9	Danny Z. Chen, Xiaobo Hu 0001	Fast and Efficient Operations on Parallel Priority Queues.	ISAAC	1994	DBLP DOI BibTeX RDF
9	Sun-Yuan Hsieh, Chin-Wen Ho	An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs.	ISAAC	1994	DBLP DOI BibTeX RDF
9	Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem.	ISAAC	1994	DBLP DOI BibTeX RDF
9	Paolo Ferragina	Incremental Text Editing: A New Data Structure.	ESA	1994	DBLP DOI BibTeX RDF
9	Sajal K. Das 0001, Paolo Ferragina	An o(n) Work EREW Parallel Algorithm for Updating MST.	ESA	1994	DBLP DOI BibTeX RDF
9	Joseph Gil, Yossi Matias	Simple Fast Parallel Hashing.	ICALP	1994	DBLP DOI BibTeX RDF
9	Sanguthevar Rajasekaran, Suneeta Ramaswami	Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems.	SCG	1994	DBLP DOI BibTeX RDF
9	Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.	MFCS	1994	DBLP DOI BibTeX RDF
9	Jörg Keller 0001, Wolfgang J. Paul, Dieter Scheerer	Realization of PRAMs: Processor Design.	WDAG	1994	DBLP DOI BibTeX RDF
9	Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing	Time-Optimal Tree Computations on Sparse Meshes.	WG	1994	DBLP DOI BibTeX RDF	meshes with multiple broadcasting, traversais, tree reconstruction, parentheses algorithms, encoding, decoding, binary trees, ordered trees
9	Zhi-Zhong Chen	The Maximal f-Dependent Set Problem for Planar Graphs is in NC.	WG	1994	DBLP DOI BibTeX RDF
9	Wolf Zimmermann, Welf Löwe	An Approach to Machine-Independent Parallel Programming.	CONPAR	1994	DBLP DOI BibTeX RDF
9	Stavros D. Nikolopoulos	Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices.	CONPAR	1994	DBLP DOI BibTeX RDF	Parallel algorithms, Complexity, Recognition, Graph partition, Chordal graphs, Maximal cliques, Distance matrix
9	Jingsen Chen	Parallel Heap Construction Using Multiple Selection.	CONPAR	1994	DBLP DOI BibTeX RDF	double-ended priority queues, multiple selection, parallel algorithms, Data structures, priority queues
9	Amitava Datta	Efficient Parallel Algorithms for Geometric k-Clustering Problems.	STACS	1994	DBLP DOI BibTeX RDF
9	Louis Mak	Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version).	STACS	1994	DBLP DOI BibTeX RDF
9	Sven Schuierer	Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.	SWAT	1994	DBLP DOI BibTeX RDF
9	Erik Schenk	Parallel Dynamic Lowest Common Ancestors.	SWAT	1994	DBLP DOI BibTeX RDF
9	Sven Schuierer	An O(log N) Algorithm to Compute the Kernel of a Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
9	Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie	An W(log log n) Lower Bound for Routing in Optical Networks.	SPAA	1994	DBLP DOI BibTeX RDF
9	Jaswinder Pal Singh, Edward Rothberg, Anoop Gupta	Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems?	SPAA	1994	DBLP DOI BibTeX RDF
9	Margaret Reid-Miller	List Ranking and List Scan on the Cray C-90.	SPAA	1994	DBLP DOI BibTeX RDF
9	John H. Reif	O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices.	SPAA	1994	DBLP DOI BibTeX RDF	dense matrices, parallel algorithms, linear systems, sparse matrices, LU factorization, Newton iteration, banded matrices
9	John H. Reif, Stephen R. Tate	Dynamic Parallel Tree Contraction (Extended Abstract).	SPAA	1994	DBLP DOI BibTeX RDF
9	Danny Z. Chen	Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon.	ISAAC	1993	DBLP DOI BibTeX RDF
9	Vijaya Ramachandran, Honghua Yang	An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.	ESA	1993	DBLP DOI BibTeX RDF
9	Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia	Optimal Upward Planarity Testing of Single-Source Digraphs.	ESA	1993	DBLP DOI BibTeX RDF
9	Ernst W. Mayr, Ralph Werchner	Optimal Tree Contraction on the Hypercube and Related Networks.	ESA	1993	DBLP DOI BibTeX RDF
9	Nancy M. Amato, Franco P. Preparata	An NC Parallel 3D Convex Hull Algorithm.	SCG	1993	DBLP DOI BibTeX RDF
9	Michael T. Goodrich	Geometric Partitioning Made Easier, Even in Parallel.	SCG	1993	DBLP DOI BibTeX RDF
9	Shiva Chaudhuri, Torben Hagerup, Rajeev Raman	Approximate and Exact Deterministic Parallel Selection.	MFCS	1993	DBLP DOI BibTeX RDF
9	Louis Ibarra, Dana S. Richards	Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.	MFCS	1993	DBLP DOI BibTeX RDF
9	Hans L. Bodlaender	On Reduction Algorithms for Graphs with Small Treewidth.	WG	1993	DBLP DOI BibTeX RDF
9	Ludek Kucera	Coloring k-Colorable Graphs in Constant Expected Parallel Time.	WG	1993	DBLP DOI BibTeX RDF
9	Sivaprakasam Sunder, Xin He	Scheduling Interval Ordered Tasks in Parallel.	STACS	1993	DBLP DOI BibTeX RDF
9	Kenneth M. McDonald, Joseph G. Peters	Smallest paths in simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
9	Jingsen Chen	Merging and Splitting Priority Queues and Deques in Parallel.	ISTCS	1992	DBLP DOI BibTeX RDF
9	Victor Y. Pan	New Resultant Inequalities and Complex Polynomial Factorization.	ISTCS	1992	DBLP DOI BibTeX RDF
9	Omer Berkman, Yossi Matias, Uzi Vishkin	Randomized Range-Maxima inNearly-Constant Parallel Time.	ISAAC	1992	DBLP DOI BibTeX RDF
9	Tatsuya Akutsu	Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions.	ISAAC	1992	DBLP DOI BibTeX RDF
9	Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis	An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects.	ISAAC	1992	DBLP DOI BibTeX RDF
9	Philip D. MacKenzie	Load Balancing Requires Omega(log*n) Expected Time.	SODA	1992	DBLP BibTeX RDF
9	Joseph Cheriyan, John H. Reif	Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity.	SODA	1992	DBLP BibTeX RDF
9	Danny Z. Chen	An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon.	SCG	1992	DBLP DOI BibTeX RDF
9	John Hershberger 0001	Optimal Parallel Algorithms for Triangulated Simple Polygons.	SCG	1992	DBLP DOI BibTeX RDF
9	Alak Kumar Datta, Ranjan K. Sen	An Efficient Parallel Algorithm for Maximal Matching.	CONPAR	1992	DBLP DOI BibTeX RDF
9	Jingsen Chen, Christos Levcopoulos	Improved Parallel Sorting of Presorted Sequences.	CONPAR	1992	DBLP DOI BibTeX RDF
9	Torben Hagerup	The Log-Star Revolution.	STACS	1992	DBLP DOI BibTeX RDF
9	Arvind Gupta, Naomi Nishimura	The Parallel Complexity of Tree Embedding Problems (Extended Abstract).	STACS	1992	DBLP DOI BibTeX RDF
9	Sajal K. Das 0001, Calvin Ching-Yuen Chen	Efficient Parallel Algorithms on Interval Graphs.	PARLE	1992	DBLP DOI BibTeX RDF
9	Subir Kumar Ghosh, Anil Maheshwari	Parallel Algorithms for All Minimum Link Paths and Link Center Problems.	SWAT	1992	DBLP DOI BibTeX RDF
9	Alexandros V. Gerbessiotis, Leslie G. Valiant	Direct Bulk-Synchronous Parallel Algorithms.	SWAT	1992	DBLP DOI BibTeX RDF
9	Maria Cristina Pinotti, Geppino Pucci	Parallel Algorithms for Priority Queue Operations.	SWAT	1992	DBLP DOI BibTeX RDF	Parallel Algorithms, Data Structures, Analysis of Algorithms, Heaps
9	Xin He	Parallel Algorithm for Cograph Recognition with Applications.	SWAT	1992	DBLP DOI BibTeX RDF
9	Torben Hagerup	Fast Parallel Generation of Random Permutations.	ICALP	1991	DBLP DOI BibTeX RDF
9	Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster	The POwer of Reconfiguration.	ICALP	1991	DBLP DOI BibTeX RDF
9	Martin Fürer	An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.	ICALP	1991	DBLP DOI BibTeX RDF
9	Hermann Jung 0001, Maria J. Serna, Paul G. Spirakis	A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.	ICALP	1991	DBLP DOI BibTeX RDF
9	Uzi Vishkin	Strutural Parallel Algorithmics.	ICALP	1991	DBLP DOI BibTeX RDF
9	Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter	Lower bounds and parallel algorithms for planar orthogonal grid drawings.	SPDP	1991	DBLP DOI BibTeX RDF
9	Rong Lin, Stephan Olariu	An optimal parallel matching algorithm for cographs.	SPDP	1991	DBLP DOI BibTeX RDF
9	Hua Lin, Mi Lu, Jesse Zhixi Fang	An optimal algorithm for the longest common subsequence problem.	SPDP	1991	DBLP DOI BibTeX RDF
9	Fang Wan	New divide-and-conquer techniques for finding disjoint paths.	SPDP	1991	DBLP DOI BibTeX RDF
9	Thomas H. Spencer	Parallel matching on expanders.	SPDP	1991	DBLP DOI BibTeX RDF
9	David J. Haglin	On a fast deterministic parallel approximate matching algorithm.	SPDP	1991	DBLP DOI BibTeX RDF
9	Pilar de la Torre, Raymond Greenlaw	Super critical tree numbering and optimal tree ranking are in NC.	SPDP	1991	DBLP DOI BibTeX RDF
9	Ying Zhang, Alan K. Mackworth	Parallel and distributed algorithms for finite constraint satisfaction problems.	SPDP	1991	DBLP DOI BibTeX RDF
9	Todd Heywood, Sanjay Ranka	A practical hierarchical model of parallel computation.	SPDP	1991	DBLP DOI BibTeX RDF
9	Peter Rossmanith	The Owner Concept for PRAMs.	STACS	1991	DBLP DOI BibTeX RDF
9	Françoise Baude, Guy Vidal-Naquet	Actors as a Parallel Programming Model.	STACS	1991	DBLP DOI BibTeX RDF
9	Ip-Wang Chan, Donald K. Friesen	An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem.	ICCI	1991	DBLP DOI BibTeX RDF
9	Sajal K. Das 0001, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad	Some Fast Parallel Algorithms for Parentheses Matching.	ICCI	1991	DBLP DOI BibTeX RDF
9	Martin Fürer	Contracting Planar Graphs Efficiency in Parallel.	FSTTCS	1991	DBLP DOI BibTeX RDF	Additional Keywords and Phrases Planar graphs, Fáry embeddings, Parallel algorithms
9	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
9	Richard Cole 0001, Michael T. Goodrich, Colm Ó'Dúnlaing	Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).	ICALP	1990	DBLP DOI BibTeX RDF
9	Prabhakar Radge	The Parallel Simplicity of Compaction and Chaining.	ICALP	1990	DBLP DOI BibTeX RDF
9	Michael T. Goodrich, Steven B. Shauck, Sumanta Guha	Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version).	SCG	1990	DBLP DOI BibTeX RDF
9	Peter Rajcáni	Optimal Parallel 3-Colouring Algorithm for Rooted Trees and Its Application.	IMYCS	1990	DBLP DOI BibTeX RDF
9	Rong Lin, Stephan Olariu	On the parallel recognition of some tree-representable graphs.	SPDP	1990	DBLP DOI BibTeX RDF
9	David G. Kirkpatrick, Teresa M. Przytycka	An optimal parallel minimax tree algorithm.	SPDP	1990	DBLP DOI BibTeX RDF
9	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
9	Venkatraman Viswanathan, Shou-Hsuan Stephen Huang, Hongfei Liu	Parallel dynamic programming.	SPDP	1990	DBLP DOI BibTeX RDF
9	Vassilis J. Tsotras, B. Gopinath, George W. Hart	Using universe knowledge and arithmetic to get faster parallel algorithms.	SPDP	1990	DBLP DOI BibTeX RDF
9	Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan	Parallel algorithms for ranking of trees.	SPDP	1990	DBLP DOI BibTeX RDF
9	Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki	Parallel Algorithms for Finding Steiner Forests in Planar Graphs.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
9	Wen-Jing Hsu, Xiaola Lin	Parallel Algorithms for Labeling Image Components.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
9	Michal Chytil, Burkhard Monien	Caterpillars and Context-Free Languages.	STACS	1990	DBLP DOI BibTeX RDF
9	Sung Kwon Kim	A Parallel Algorithm for Path-Min Queries in Trees.	ICCI	1990	DBLP DOI BibTeX RDF
9	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.	SWAT	1990	DBLP DOI BibTeX RDF