Search results for "exclusive-read-exclusive-write parallel random-access machine"

Found 6 publication records. Showing 6 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Stephan Olariu, Zhaofang Wen	Optimal Parallel Initialization Algorithms for a Class of Priority Queues.	IEEE Trans. Parallel Distrib. Syst.	1991	DBLP DOI BibTeX RDF	parallel initialization algorithms, adaptive parallel algorithm, priority queue structure, n-element array, parallel construction algorithms, heap-like structures, double-endedpriority queues, min-max heaps, deeps, min-max-pair heaps, exclusive-read-exclusive-write parallel random-access machine, parallel algorithms, data structures, queueing theory, processors, computationalcomplexity
1	Anil Maheshwari, Andrzej Lingas	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.	STACS	1994	DBLP DOI BibTeX RDF
1	Jingsen Chen	Merging and Splitting Priority Queues and Deques in Parallel.	ISTCS	1992	DBLP DOI BibTeX RDF
1	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
1	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
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

Displaying result #1 - #6 of 6 (100 per page; Change: )