default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhiram G. Ranade
Person information
- affiliation: Indian Institute of Technology, Bombay, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c27]Apoorv Garg, Abhiram Ranade:
Scheduling Trains with Small Stretch on a Unidirectional Line. CALDAM 2021: 16-31
2010 – 2019
- 2019
- [j18]Jonas Harbering, Abhiram Ranade
, Marie Schmidt, Oliver Sinnen:
Complexity, bounds and dynamic programming algorithms for single track train scheduling. Ann. Oper. Res. 273(1-2): 479-500 (2019) - 2018
- [j17]Sarang Kulkarni, Rahul Patil, Mohan Krishnamoorthy, Andreas T. Ernst, Abhiram Ranade:
A new two-stage heuristic for the recreational vehicle scheduling problem. Comput. Oper. Res. 91: 59-78 (2018) - 2017
- [j16]Pushkar J. Godbole, Abhiram G. Ranade, Rajkumar S. Pant:
Branch-and-Bound Global-Search Algorithm for Aircraft Ground Movement Optimization. J. Aerosp. Inf. Syst. 14(6): 316-326 (2017) - [c26]Apoorv Garg, Abhiram G. Ranade:
Train Scheduling on a Unidirectional Path. FSTTCS 2017: 29:1-29:14 - 2016
- [c25]Abhiram G. Ranade:
Introductory Programming: Let Us Cut through the Clutter! ITiCSE 2016: 278-283 - 2015
- [j15]Ajit A. Diwan, Soumitra Pal, Abhiram G. Ranade:
Fragmented coloring of proper interval and split graphs. Discret. Appl. Math. 193: 110-118 (2015) - 2013
- [c24]Abhiram Ranade, Shripad Sarade:
DrawCAD: mouse-sketch-based engineering drawing. APCHI 2013: 344-353 - 2012
- [j14]Soumitra Pal, Abhiram Ranade:
Scheduling light-trails on WDM rings. J. Parallel Distributed Comput. 72(10): 1226-1236 (2012) - [i2]Ajit A. Diwan, Soumitra Pal, Abhiram Ranade:
Component Coloring of Proper Interval Graphs and Split Graphs. CoRR abs/1201.3273 (2012) - 2011
- [c23]Aditya Varma, Abhiram Ranade, Srinivas Aluru:
An improved maximum likelihood formulation for accurate genome assembly. ICCABS 2011: 165-170 - [i1]Soumitra Pal, Abhiram Ranade:
Scheduling Light-trails in WDM Rings. CoRR abs/1112.6254 (2011)
2000 – 2009
- 2008
- [j13]Devdatta Gangal, Abhiram G. Ranade:
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal. J. Comput. Syst. Sci. 74(7): 1139-1146 (2008) - [j12]Viswanath Nagarajan, Abhiram G. Ranade:
Exact train pathing. J. Sched. 11(4): 279-297 (2008) - 2007
- [j11]Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale:
A variation on SVD based image compression. Image Vis. Comput. 25(6): 771-777 (2007) - 2003
- [j10]Abhiram G. Ranade:
Scheduling loosely connected task graphs. J. Comput. Syst. Sci. 67(1): 198-208 (2003) - 2000
- [c22]Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa:
Register Efficient Mergesorting. HiPC 2000: 96-103 - [c21]Mayur Datar, Abhiram G. Ranade:
Commuting with delay prone buses. SODA 2000: 22-29
1990 – 1999
- 1999
- [c20]Kamesh Munagala, Abhiram G. Ranade:
I/O-Complexity of Graph Algorithms. SODA 1999: 687-694 - 1998
- [j9]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. J. Parallel Distributed Comput. 51(2): 75-88 (1998) - [c19]Abhiram Ranade:
A simple optimal list ranking algorithm. HiPC 1998: 60-64 - 1996
- [j8]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 45(6): 714-729 (1996) - [c18]Abhiram G. Ranade:
Bandwidth Efficient Parallel Computation. ICALP 1996: 4-23 - 1995
- [j7]Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt:
SPAR: A New Architecture for Large Finite Element Computations. IEEE Trans. Computers 44(4): 531-545 (1995) - [j6]M. T. Raghunath, Abhiram Ranade:
Designing Interconnection Networks for Multi-level Packaging. VLSI Design 2(4): 375-388 (1995) - [c17]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242 - 1994
- [j5]Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao:
Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms 17(1): 157-205 (1994) - [j4]Abhiram G. Ranade:
Optimal Speedup for Backtrack Search on a Butterfly Network. Math. Syst. Theory 27(1): 85-101 (1994) - [c16]Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson:
Nearly Tight Bounds for Wormhole Routing. FOCS 1994: 347-355 - [c15]Abhiram Ranade, Szu-Tsung Cheng, Etienne Deprit, Jeff A. Jones, Sun-Inn Shih:
Parallelism and locality in priority queues. SPDP 1994: 490-496 - 1993
- [j3]Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg:
Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993) - [c14]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: 49-60 - [c13]David T. Blackston, Abhiram G. Ranade:
SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms. ICPP (3) 1993: 201-204 - [c12]M. T. Raghunath, Abhiram G. Ranade:
Designing interconnection networks for multi-level packaging. SC 1993: 772-781 - [c11]Bob Boothe, Abhiram G. Ranade:
Performance on a Bandwidth Constrained Network: How much bandwidth do we need? SC 1993: 906-915 - 1992
- [j2]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM J. Comput. 21(4): 639-654 (1992) - [c10]Bob Boothe, Abhiram G. Ranade:
Improved Multithreading Techniques for Hiding Communication Latency in Multiprocessors. ISCA 1992: 214-223 - [c9]Abhiram G. Ranade:
A Framework for Analyzing Locality and Portability Issues in Parallel Computing. Heinz Nixdorf Symposium 1992: 185-194 - [c8]Abhiram G. Ranade:
Maintaining Dynamic Ordered Sets on Processor Networks. SPAA 1992: 127-137 - 1991
- [j1]Abhiram G. Ranade:
How to Emulate Shared Memory. J. Comput. Syst. Sci. 42(3): 307-326 (1991) - [c7]Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt:
Three-dimensional finite-element analyses: implications for computer architectures. SC 1991: 786-795 - [c6]Abhiram G. Ranade:
Optimal Speedup for Backtrack Search on a butterfly Network. SPAA 1991: 40-48 - 1990
- [c5]M. T. Raghunath, Abhiram G. Ranade:
A Simulation-Based Comparison of Interconnection Networks. SPDP 1990: 98-105
1980 – 1989
- 1989
- [c4]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989: 224-234 - 1987
- [c3]Abhiram G. Ranade:
How to emulate shared memory (Preliminary Version). FOCS 1987: 185-194 - [c2]Abhiram G. Ranade, S. Lennart Johnsson:
The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton. ICPP 1987: 479-482 - 1985
- [c1]Abhiram G. Ranade:
Interconnection Networks And Parallel Memory Organizations For Array Processing. ICPP 1985: 41-47
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
