Search results for "random-access-machine"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
31	Nader H. Bshouty	On the Complexity of Functions for Random Access Machines.	J. ACM	1993	DBLP DOI BibTeX RDF	indirect addressing, sorting, greatest common divisor, random access machine
28	Lorrie Fava Lindon, Selim G. Akl	An Optimal Implementation of Broadcasting with Selective Reduction.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	optimal implementation, broadcasting with selective reduction, concurrent-read concurrent-write, concurrentmemory access, BROADCAST instruction, memory locations, parallel computation, parallel random access machine, PRAM, instruction sets, random-access storage, parallelalgorithms
27	Ann M. Bouchard, Gordon C. Osbourn	Dynamic self-assembly in living systems as computation.	Nat. Comput.	2006	DBLP DOI BibTeX RDF	biological information processing, microtubule, motor protein, protein network, unary number, algorithm, computation, computing, information, self-assembly, stochastic, random access machine
25	Stephan Olariu, Zhaofang Wen	Optimal Parallel Initialization Algorithms for a Class of Priority Queues.	IEEE Trans. Parallel Distributed 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
25	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
22	Loukas Georgiadis, Robert Endre Tarjan	Finding dominators revisited: extended abstract.	SODA	2004	DBLP BibTeX RDF
22	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	On approximating the ideal random access machine by physical machines.	J. ACM	2009	DBLP DOI BibTeX RDF	Physical constraints on machines, pipelined hierarchical memory, speculative processors
19	Afonso Ferreira	Parallel Computing: Models.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Models for parallel computing, Bulk synchronous parallel computer, Shared memory parallel machines, Distributed memory parallel machines, Parallel algorithm, Grid, Hypercube, PRAM, Parallel random access machine, PC clusters, Algorithm design, BSP, CGM, Coarse grained multicomputer
19	Sun-Yuan Hsieh	An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	The perfect domination problem, Parallel algorithms, Parallel random access machine (PRAM), Distance-hereditary graphs
19	Stanley C. Eisenstat	O(log* n) algorithms on a Sum-CRCW PRAM.	Computing	2007	DBLP DOI BibTeX RDF	parallel prefix sums, linear integer sorting, Parallel random access machine
19	Martin Sauerhoff, Philipp Woelfel	Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.	STOC	2003	DBLP DOI BibTeX RDF	hash class, lower bound, branching program, time-space tradeoff, integer multiplication, random access machine
19	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Dynamic Data Structures on Algebraic RAMs.	Algorithmica	2002	DBLP DOI BibTeX RDF	Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
19	Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi	Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.	Algorithmica	2001	DBLP DOI BibTeX RDF	Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
19	Keqin Li 0001, Yi Pan 0001, Si-Qing Zheng	Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	Concurrent read, concurrent write, deterministic simulation, probabilistic simulation, sorting, shared memory, time complexity, parallel random access machine, linear array, optical bus
19	Chang-Wu Yu 0001, Gen-Huey Chen	An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Bipartite-permutation graph, graph recognition, parallel algorithm and parallel random access machine, graph isomorphism
19	Jörg Keller 0001, Thomas Rauber, Bernd Rederlechner	Conservative Circuit Simulation on Shared-Memory Multiprocessors.	Workshop on Parallel and Distributed Simulation	1996	DBLP DOI BibTeX RDF	multiprefix operation, speedup estimation, shared memory multiprocessor, parallel random access machine (PRAM), circuit simulation, conservative simulation
19	Bruce M. Maggs	A Critical Look at Three of Parallel Computing's Maxims.	ISPAN	1996	DBLP DOI BibTeX RDF	architectural convergence, parallel computer, wormhole routing, parallel random-access machine (PRAM)
19	Mi Lu, Hua Lin	Parallel Algorithms for the Longest Common Subsequence Problem.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound
19	Etienne Grandjean, Frédéric Olive	Monadic Logical Definability of NP-Complete Problems.	CSL	1994	DBLP DOI BibTeX RDF	Computational complexity, NP-complete problem, nondeterminism, finite model theory, monadic second-order logic, linear time, random access machine
19	Amir M. Ben-Amram, Zvi Galil	When can we sort in o(n log n) time?	FOCS	1993	DBLP DOI BibTeX RDF	Boolean instructions, arithmetic instructions, nonuniform programs, double-precision multiplication, lower bounds, upper bounds, random access machine
19	Yonatan Aumann, Michael Ben-Or	Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	dynamically faulty network, asymptotically optimal PRAM emulation, parallel random access machine, faulty hypercubes, memory modules
19	Jens Lagergren	Efficient Parallel Algorithms for Tree-Decomposition and Related Problems	FOCS	1990	DBLP DOI BibTeX RDF	sequential time complexity, monadic second order properties, linear extended monadic second order extremum problems, concurrent-read, concurrent-write parallel random access machine, enumeration problems, parallel algorithms, graphs, tree-decomposition, tree width, CRCW PRAM
19	Charles U. Martel, Ramesh Subramonian, Arvin Park	Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs	FOCS	1990	DBLP DOI BibTeX RDF	synchronous PRAMs, asynchronous behavior, CRCW, concurrent-read, concurrent-write, asynchronous CRCW PRAM, expected work, parallel step, parallel instructions, fail-stop error, parallel random-access-machine, synchronization primitive, simulation technique
19	Bowen Alpern, Larry Carter, Ephraim Feig	Uniform Memory Hierarchies	FOCS	1990	DBLP DOI BibTeX RDF	RAM complexity, uniform memory hierarchy, computer memory, FFT programs, parallelism, RAM, parsimonious, random-access-machine
19	Kieran T. Herley	Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version)	FOCS	1989	DBLP DOI BibTeX RDF	small shared memories, bounded degree networks, PRAM algorithms, simulation, parallel random-access machine, PRAM
19	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
19	Elias Dahlhaus, Marek Karpinski	An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	minimal elimination ordering, MEO, arbitrary graph, concurrent-read-concurrent-write parallel random-access machine, parallel algorithm, divide-and-conquer, CRCW PRAM
19	Elias Dahlhaus, Péter Hajnal, Marek Karpinski	Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs	FOCS	1988	DBLP DOI BibTeX RDF	Hamiltonian cycle problem, dense graphs, concurrent-read-exclusive-write parallel random-access machine, graph, NP-complete, perfect matching, vertex, optimal parallel algorithm, polylogarithmic factor
19	Michael Luby	Removing Randomness in Parallel Computation Without a Processor Penalty	FOCS	1988	DBLP DOI BibTeX RDF	maximal-matching problem, randomness removing, randomized NC algorithms, pairwise independence, concurrent-read-concurrent-write parallel random-access machine, maximal-independent-set problem, parallel algorithm, parallel computation, vertex coloring
18	Rafail Ostrovsky	An Efficient Software Protection Scheme.	CRYPTO	1989	DBLP DOI BibTeX RDF
18	Bruno Martin	A Uniform Universal CREW PRAM.	MFCS	1993	DBLP DOI BibTeX RDF
16	Oded Goldreich 0001, Rafail Ostrovsky	Software Protection and Simulation on Oblivious RAMs.	J. ACM	1996	DBLP DOI BibTeX RDF	simulation of random access machines, software protection, pseudorandom functions
15	Kenneth W. Regan	On the Difference Between Turing Machine Time and Random-Access Machine Time.	ICCI	1993	DBLP BibTeX RDF
15	J. M. Robson	Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time	Inf. Comput.	1992	DBLP DOI BibTeX RDF
14	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	Computational power of pipelined memory hierarchies.	SPAA	2001	DBLP DOI BibTeX RDF
12	Louis Mak	Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version).	STACS	1994	DBLP DOI BibTeX RDF
12	Cornelis A. Middelburg	Program Algebra for Random Access Machine Programs.	Sci. Ann. Comput. Sci.	2022	DBLP DOI BibTeX RDF
12	Cornelis A. Middelburg	Program algebra for random access machine programs.	CoRR	2020	DBLP BibTeX RDF
12	Shlomi Dolev, Yin Li	Secret Shared Random Access Machine.	IACR Cryptol. ePrint Arch.	2015	DBLP BibTeX RDF
12	Shlomi Dolev, Yin Li	Secret Shared Random Access Machine.	ALGOCLOUD	2015	DBLP DOI BibTeX RDF
12	Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi 0001	A Tamper and Leakage Resilient Random Access Machine.	IACR Cryptol. ePrint Arch.	2014	DBLP BibTeX RDF
12	Daniela Chudá, Martin Nehéz, Michal Cernanský	On using of random access machine simulators in teaching of theoretical computer science.	CompSysTech	2009	DBLP DOI BibTeX RDF
12	Rajagopal Nagarajan, Nikolaos Papanikolaou 0001, David Williams	Simulating and Compiling Code for the Sequential Quantum Random Access Machine.	QPL	2005	DBLP DOI BibTeX RDF
12	Hans J. Schneider	Introducing the parallel Random Access Machine together with FORTARN 90/95.	Bull. EATCS	2004	DBLP BibTeX RDF
12	Alexandre Tiskin	The Bulk-Synchronous Parallel Random Access Machine.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
12	Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide	Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
12	Alexandre Tiskin	The Bulk-Synchronous Parallel Random Access Machine.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
11	Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha	Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Memory bank contention, memory delays, parallel machine models, parallel algorithms, performance analysis, multiprocessors, shared memory
10	Lan Yang, Lan Jin	Integrating parallel algorithm design with parallel machine models.	SIGCSE	1995	DBLP DOI BibTeX RDF
10	Torben Hagerup, Arno Schmitt, Helmut Seidl	FORK: A High-Level Language for PRAMs.	PARLE (1)	1991	DBLP DOI BibTeX RDF
10	Bernard Chazelle	Lower Bounds for Orthogonal Range Searching: I. The Reporting Case	J. ACM	1990	DBLP DOI BibTeX RDF
9	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	Optimal organizations for pipelined hierarchical memories.	SPAA	2002	DBLP DOI BibTeX RDF	hierarchical memory processor, scalable pipeline
9	Ben H. H. Juurlink, Harry A. G. Wijshoff	The Parallel Hierarchical Memory Model.	SWAT	1994	DBLP DOI BibTeX RDF	algorithms, data locality, Hierarchical memory
8	David R. Karger, Philip N. Klein, Robert Endre Tarjan	A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees.	J. ACM	1995	DBLP DOI BibTeX RDF	randomized algorithm, minimum spanning tree, matroid
8	Guy E. Blelloch	Parallel thinking.	PPoPP	2009	DBLP DOI BibTeX RDF	algorithms, education, parallelism
8	Bruce M. Maggs, Lesley R. Matheson, Robert Endre Tarjan	Models of parallel computation: a survey and synthesis.	HICSS (2)	1995	DBLP DOI BibTeX RDF	unifying parallel model, machine diversity, machine design, design community, unifying paradigm, model design philosophy, prescriptivity, abstract computational models, performance, parallel processing, survey, language design, reviews, algorithm design, computation theory, simplicity, descriptivity, parallel computation models
8	Andrea Pietracaprina, Geppino Pucci	Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy.	ESA	1994	DBLP DOI BibTeX RDF
8	Torben Hagerup	The Log-Star Revolution.	STACS	1992	DBLP DOI BibTeX RDF
8	Etienne Grandjean	Linear Time Algorithms and NP-Complete Problems.	CSL	1992	DBLP DOI BibTeX RDF
8	Rüdiger Reischuk	Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.	J. ACM	1987	DBLP DOI BibTeX RDF
8	Deepak D. Sherlekar, Shaunak Pawagi, I. V. Ramakrishnan	O(1) Parallel Time Incremental Graph Algorithms.	FSTTCS	1985	DBLP DOI BibTeX RDF
8	Thore Husfeldt, Theis Rauhe	Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method.	ICALP	1998	DBLP DOI BibTeX RDF
6	Yoav Giyora, Haim Kaplan	Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Ray shooting, planar point location
6	Martti Forsell	On the performance and cost of some PRAM models on CMP hardware.	IPDPS	2008	DBLP DOI BibTeX RDF
6	Shih-Ying Lin, Shi-Jinn Horng, Tzong-Wann Kao, Chin-Shyurng Fahn, Pingzhi Fan, Cheng-Ling Lee, Anu G. Bourgeois	3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM.	ICA3PP	2008	DBLP DOI BibTeX RDF	CREW, block-based medial axis transform, chessboard distance transform, parallel algorithm, image processing, Euclidean distance transform, PRAM model
6	Rajneesh Hegde	Finding 3-shredders efficiently.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	four-connected, shredder, vertex cut, Depth-first search
6	Bikash Kanti Sarkar, Shahid Jamal, Bhagirath Kumar	An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements.	ICIT	2006	DBLP DOI BibTeX RDF	largest, Second_largest, P-RAM, optimal
6	Ho-Kwok Dai, Hung-Chi Su	A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.	LATIN	2006	DBLP DOI BibTeX RDF
6	Peter Bro Miltersen	Lower bounds on the size of selection and rank indexes.	SODA	2005	DBLP BibTeX RDF
6	Christoph W. Kessler	A practical access to the theory of parallel algorithms.	SIGCSE	2004	DBLP DOI BibTeX RDF	parallel program visualization, teaching parallel algorithms, parallel programming, fork, PRAM model
6	Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis	Improved Bounds for Finger Search on a RAM.	ESA	2003	DBLP DOI BibTeX RDF
6	Krishna V. Palem	Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective.	Verification: Theory and Practice	2003	DBLP DOI BibTeX RDF
6	Edson Cáceres, C. Y. Nasu	A BSP/CGM Algorithm for Computing Euler Tours in Graphs.	SBAC-PAD	2003	DBLP DOI BibTeX RDF
6	Casiano Rodríguez	The Design and Analysis of Parallel Algorithms.	PDP	2002	DBLP DOI BibTeX RDF
6	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
6	Uzi Vishkin	What to Do with All this Hardware? (Invited Lecture).	CPM	2001	DBLP DOI BibTeX RDF
6	Darko Kirovski, Miodrag Potkonjak, Lisa M. Guerra	Cut-based functional debugging for programmable systems-on-chip.	IEEE Trans. Very Large Scale Integr. Syst.	2000	DBLP DOI BibTeX RDF
6	G. Sajith, Sanjeev Saxena	Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.	Algorithmica	2000	DBLP DOI BibTeX RDF	CRCW model, Tree colouring, Parallel algorithms, Optimal algorithms, Maximal independent set
6	Torben Hagerup	Improved Shortest Paths on the Word RAM.	ICALP	2000	DBLP DOI BibTeX RDF
6	Andreas Savva, Takashi Nanya	A Gracefully Degrading Massively Parallel System Using the BSP Model, and Its Evaluation.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF	memory duplication, RSM, fault tolerance, PRAM, graceful degradation, MPP, BSP model
6	David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum	Searching Constant Width Mazes Captures the AC0 Hierarchy.	STACS	1998	DBLP DOI BibTeX RDF
6	Torben Hagerup	Sorting and Searching on the Word RAM.	STACS	1998	DBLP DOI BibTeX RDF	word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms
6	Zhaofang Wen	Multiway Merging in Parallel.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	information retrieval, databases, parallel computation, sorting, merging, Analysis of algorithms, processors assignment
6	Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran	The Queue-Read Queue-Write Asynchronous PRAM Model.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
6	Michel Morvan, Laurent Viennot	Parallel Comparability Graph Recognition and Modular Decomposition.	STACS	1996	DBLP DOI BibTeX RDF
6	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
6	Anil Maheshwari, Andrzej Lingas	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.	STACS	1994	DBLP DOI BibTeX RDF
6	Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack	Optimal CREW-PRAM Algorithms for Direct Dominance Problems.	ESA	1993	DBLP DOI BibTeX RDF
6	Lefteris M. Kirousis	Fast Parallel Constraint Satisfaction.	ICALP	1993	DBLP DOI BibTeX RDF
6	Jingsen Chen	Merging and Splitting Priority Queues and Deques in Parallel.	ISTCS	1992	DBLP DOI BibTeX RDF
6	Fang Wan	New divide-and-conquer techniques for finding disjoint paths.	SPDP	1991	DBLP DOI BibTeX RDF
6	Ip-Wang Chan, Donald K. Friesen	An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem.	ICCI	1991	DBLP DOI BibTeX RDF
6	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
6	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
6	Wen-Jing Hsu, Xiaola Lin	Parallel Algorithms for Labeling Image Components.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
6	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
6	Lasse Natvig	Logarithmic time cost optimal parallel sorting is not yet fast in practice!.	SC	1990	DBLP DOI BibTeX RDF
6	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
6	Ivan Stojmenovic	Detecting intersection of two convex polygons in parallel.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
6	Ming Li 0001, Yaacov Yesha	The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.	ICALP	1987	DBLP DOI BibTeX RDF