Search results for "Abhiram G. Ranade"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Viswanath Nagarajan, Abhiram G. Ranade	Exact train pathing.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Train pathing, Train scheduling, Dynamics, Signaling, Train simulation
1	Devdatta Gangal, Abhiram G. Ranade	Precedence constrained scheduling in (2 - 7/(3p+1)) optimal.	J. Comput. Syst. Sci.	2008	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale	A variation on SVD based image compression.	Image Vision Comput.	2007	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Scheduling loosely connected task graphs.	J. Comput. Syst. Sci.	2003	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa	Register Efficient Mergesorting.	HiPC	2000	DBLP DOI BibTeX RDF
1	Mayur Datar, Abhiram G. Ranade	Commuting with delay prone buses.	SODA	2000	DBLP DOI BibTeX RDF
1	Kamesh Munagala, Abhiram G. Ranade	I/O-Complexity of Graph Algorithms.	SODA	1999	DBLP DOI BibTeX RDF
1	Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade	Tight Bounds on Parallel List Marking.	J. Parallel Distrib. Comput.	1998	DBLP DOI BibTeX RDF
1	Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe	On Bufferless Routing of Variable Length Messages in Leveled Networks.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Bandwidth Efficient Parallel Computation.	ICALP	1996	DBLP DOI BibTeX RDF
1	Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt	SPAR: A New Architecture for Large Finite Element Computations.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	Computer architecture, finite element method, sparse matrices, resource utilization, compact data structures
1	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
1	Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao	Randomized Routing and Sorting on Fixed-Connection Networks.	J. Algorithms	1994	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Optimal Speedup for Backtrack Search on a Butterfly Network.	Mathematical Systems Theory	1994	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson	Nearly Tight Bounds for Wormhole Routing	FOCS	1994	DBLP DOI BibTeX RDF	nearly tight bounds, high probability, lower bound, trees, routing algorithm, wormhole routing, optimal algorithms, two-dimensional mesh, Butterfly networks, multidimensional meshes
1	Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg	Scattering and Gathering Messages in Networks of Processors.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	message scattering, messages gathering, networks of processors, trees of processors, noncolliding paths, queueing mechanisms, scheduling, distributed processing, multiprocessor interconnection networks, spanning trees, buffering
1	Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe	On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).	ESA	1993	DBLP DOI BibTeX RDF
1	M. T. Raghunath, Abhiram G. Ranade	Designing interconnection networks for multi-level packaging.	SC	1993	DBLP DOI BibTeX RDF
1	Bob Boothe, Abhiram G. Ranade	Performance on a Bandwidth Constrained Network: How much bandwidth do we need?	SC	1993	DBLP BibTeX RDF
1	David T. Blackston, Abhiram G. Ranade	SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms.	ICPP	1993	DBLP BibTeX RDF
1	Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe	Dynamic Tree Embeddings in Butterflies and Hypercubes.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Bob Boothe, Abhiram G. Ranade	Improved Multithreading Techniques for Hiding Communication Latency in Multiprocessors.	ISCA	1992	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	A Framework for Analyzing Locality and Portability Issues in Parallel Computing.	Heinz Nixdorf Symposium	1992	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Maintaining Dynamic Ordered Sets on Processor Networks.	SPAA	1992	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	How to Emulate Shared Memory.	J. Comput. Syst. Sci.	1991	DBLP DOI BibTeX RDF
1	Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt	Three-dimensional finite-element analyses: implications for computer architectures.	SC	1991	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Optimal Speedup for Backtrack Search on a butterfly Network.	SPAA	1991	DBLP DOI BibTeX RDF
1	M. T. Raghunath, Abhiram G. Ranade	A Simulation-Based Comparison of Interconnection Networks.	SPDP	1990	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe	Dynamic Tree Embeddings in Butterflies and Hypercubes.	SPAA	1989	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade, S. Lennart Johnsson	The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton.	ICPP	1987	DBLP BibTeX RDF
1	Abhiram G. Ranade	How to emulate shared memory (Preliminary Version)	FOCS	1987	DBLP DOI BibTeX RDF
1	Abhiram G. Ranade	Interconnection Networks And Parallel Memory Organizations For Array Processing.	ICPP	1985	DBLP BibTeX RDF

Publications of "Abhiram G. Ranade" ( http://dblp.L3S.de/Authors/Abhiram_G._Ranade )