Search results for "Pointer-Jumping"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
83	Emanuele Viola, Avi Wigderson	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.	FOCS	2007	DBLP DOI BibTeX RDF
73	Yosi Ben-Asher, Gadi Haber	Parallel Solutions of Simple Indexed Recurrence Equations.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	Ordinary recurrence equations, indexed recurrence equations, pointer jumping, parallel prefix sums, Livermore Loops benchmark, parallelizing compilers, list ranking, tree contraction, Euler tour
65	Amit Chakrabarti	Lower Bounds for Multi-Player Pointer Jumping.	CCC	2007	DBLP DOI BibTeX RDF
65	André Gronemeier	NOF-Multiparty Information Complexity Bounds for Pointer Jumping.	MFCS	2006	DBLP DOI BibTeX RDF
65	Carsten Damm, Stasys Jukna, Jirí Sgall	Some Bounds on Multiparty Communication Complexity of Pointer Jumping.	STACS	1996	DBLP DOI BibTeX RDF
55	Jop F. Sibeyn	One-by-One Cleaning for Practical Parallel List Ranking.	Algorithmica	2002	DBLP DOI BibTeX RDF	Algorithms, Parallel computing, Implementation, List ranking
55	Amir M. Ben-Amram, Zvi Galil	A Generalization of a Lower Bound Technique due to Fredman and Saks.	Algorithmica	2001	DBLP DOI BibTeX RDF	Algorithms, Parallel computing, Implementation, List ranking
55	Vasanth Krishna Namasivayam, Viktor K. Prasanna	Scalable Parallel Implementation of Exact Inference in Bayesian Networks.	ICPADS (1)	2006	DBLP DOI BibTeX RDF	Pointer-Jumping, Scalability, Bayesian Networks, Partitioning, Loop level parallelization, Junction Tree
55	James J. Little, Guy E. Blelloch, Todd A. Cass	Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	grid permutation, pointer jumping, fine-grained parallel machine, primitive operations, vector machine model, Gaussian convolution, computer vision, computer vision, parallel algorithm, parallel algorithms, parallel architectures, parallel architectures, edge detection, computerised picture processing, parallel machines, stereo, image structures
37	Jesper Larsson Träff	Portable Randomized List Ranking on Multiprocessors Using MPI.	PVM/MPI	1998	DBLP DOI BibTeX RDF
37	Yosi Ben-Asher, Gadi Haber	Parallel Solutions of Simple Index Recurrence Equations.	Euro-Par	1998	DBLP DOI BibTeX RDF
28	Joshua Brody, Mario Sánchez	Dependent Random Graphs and Multiparty Pointer Jumping.	Electron. Colloquium Comput. Complex.	2015	DBLP BibTeX RDF
28	Joshua Brody, Mario Sánchez	Dependent Random Graphs and Multiparty Pointer Jumping.	CoRR	2015	DBLP BibTeX RDF
28	Joshua Brody, Mario Sánchez	Dependent Random Graphs and Multi-Party Pointer Jumping.	APPROX-RANDOM	2015	DBLP DOI BibTeX RDF
28	Hongyu Liang	Optimal Collapsing Protocol for Multiparty Pointer Jumping.	Theory Comput. Syst.	2014	DBLP DOI BibTeX RDF
28	Michal Jastrzebski	On total communication complexity of collapsing protocols for pointer jumping problem.	CoRR	2014	DBLP BibTeX RDF
28	Emanuele Viola, Avi Wigderson	One-way multiparty communication lower bound for pointer jumping with applications.	Comb.	2009	DBLP DOI BibTeX RDF
28	Joshua Brody	The Maximum Communication Complexity of Multi-party Pointer Jumping.	Electron. Colloquium Comput. Complex.	2009	DBLP BibTeX RDF
28	Joshua Brody	The Maximum Communication Complexity of Multi-Party Pointer Jumping.	CCC	2009	DBLP DOI BibTeX RDF
28	Joshua Brody, Amit Chakrabarti	Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound	CoRR	2008	DBLP BibTeX RDF
28	Joshua Brody, Amit Chakrabarti	Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound.	STACS	2008	DBLP DOI BibTeX RDF
28	Emanuele Viola, Avi Wigderson	One-way multi-party communication lower bound for pointer jumping with applications.	Electron. Colloquium Comput. Complex.	2007	DBLP BibTeX RDF
28	Amit Chakrabarti	Lower Bounds for Multi-Player Pointer Jumping.	Electron. Colloquium Comput. Complex.	2007	DBLP BibTeX RDF
28	Carsten Damm, Stasys Jukna, Jirí Sgall	Some Bounds on Multiparty Communication Complexity of Pointer Jumping.	Comput. Complex.	1998	DBLP DOI BibTeX RDF
28	Noam Nisan, Ziv Bar-Yossef	Pointer Jumping Requires Concurrent Read	Electron. Colloquium Comput. Complex.	1997	DBLP BibTeX RDF
28	Noam Nisan, Ziv Bar-Yossef	Pointer Jumping Requires Concurrent Read.	STOC	1997	DBLP DOI BibTeX RDF
28	Carsten Damm, Stasys Jukna, Jirí Sgall	Some Bounds on Multiparty Communication Complexity of Pointer Jumping	Universität Trier, Mathematik/Informatik, Forschungsbericht	1995	RDF
28	Carsten Damm, Stasys Jukna	On Multiparity Games for Pointer Jumping	Universität Trier, Mathematik/Informatik, Forschungsbericht	1995	RDF
28	Carsten Damm, Stasys Jukna, Jirí Sgall	Some Bounds on Multiparty Communication Complexity of Pointer Jumping	Electron. Colloquium Comput. Complex.	1995	DBLP BibTeX RDF
18	M. Suhail Rehman, Kishore Kothapalli, P. J. Narayanan	Fast and scalable list ranking on the GPU.	ICS	2009	DBLP DOI BibTeX RDF	irregular algorithm, parallel algorithm, gpgpu, many-core, list ranking
18	Sudipto Guha, Andrew McGregor 0001	Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination.	ICALP (1)	2008	DBLP DOI BibTeX RDF
18	Amit Chakrabarti, Graham Cormode, Andrew McGregor 0001	Robust lower bounds for communication and stream computation.	STOC	2008	DBLP DOI BibTeX RDF	lower bounds, data streams, communication complexity
18	David A. Bader, Varun Kanade, Kamesh Madduri	SWARM: A Parallel Programming Framework for Multicore Processors.	IPDPS	2007	DBLP DOI BibTeX RDF
18	Susumu Nishimura	Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic.	AMAST	2006	DBLP DOI BibTeX RDF
18	László Babai, Thomas P. Hayes, Peter G. Kimmel	The Cost of the Missing Bit: Communication Complexity with Help.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15
18	Sun Chung, Anne Condon	Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm.	IPPS	1996	DBLP DOI BibTeX RDF