Abhiram G. Ranade

Orcid: 0000-0001-8350-0438

Affiliations:
  • Indian Institute of Technology, Bombay, India


According to our database1, Abhiram G. Ranade authored at least 42 papers between 1985 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Scheduling Trains with Small Stretch on a Unidirectional Line.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2019
Complexity, bounds and dynamic programming algorithms for single track train scheduling.
Ann. Oper. Res., 2019

2018
A new two-stage heuristic for the recreational vehicle scheduling problem.
Comput. Oper. Res., 2018

2017
Branch-and-Bound Global-Search Algorithm for Aircraft Ground Movement Optimization.
J. Aerosp. Inf. Syst., 2017

Train Scheduling on a Unidirectional Path.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Introductory Programming: Let Us Cut through the Clutter!
Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education, 2016

2015
Fragmented coloring of proper interval and split graphs.
Discret. Appl. Math., 2015

2013
DrawCAD: mouse-sketch-based engineering drawing.
Proceedings of the 11th Asia Pacific Conference on Computer Human Interaction, 2013

2012
Scheduling light-trails on WDM rings.
J. Parallel Distributed Comput., 2012

Component Coloring of Proper Interval Graphs and Split Graphs
CoRR, 2012

2011
An improved maximum likelihood formulation for accurate genome assembly.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2008
Exact train pathing.
J. Sched., 2008

Precedence constrained scheduling in (2 - 7/(3p+1)) optimal.
J. Comput. Syst. Sci., 2008

2007
A variation on SVD based image compression.
Image Vis. Comput., 2007

2003
Scheduling loosely connected task graphs.
J. Comput. Syst. Sci., 2003

2000
Commuting with delay prone buses.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Register Efficient Mergesorting.
Proceedings of the High Performance Computing, 2000

1999
I/O-Complexity of Graph Algorithms.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Tight Bounds on Parallel List Marking.
J. Parallel Distributed Comput., 1998

A simple optimal list ranking algorithm.
Proceedings of the 5th International Conference On High Performance Computing, 1998

1996
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers, 1996

Bandwidth Efficient Parallel Computation.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Designing Interconnection Networks for Multi-level Packaging.
VLSI Design, 1995

SPAR: A New Architecture for Large Finite Element Computations.
IEEE Trans. Computers, 1995

1994
Optimal Speedup for Backtrack Search on a Butterfly Network.
Math. Syst. Theory, 1994

Randomized Routing and Sorting on Fixed-Connection Networks.
J. Algorithms, 1994

Parallelism and locality in priority queues.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Nearly Tight Bounds for Wormhole Routing
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Scattering and Gathering Messages in Networks of Processors.
IEEE Trans. Computers, 1993

Performance on a Bandwidth Constrained Network: How much bandwidth do we need?
Proceedings of the Proceedings Supercomputing '93, 1993

SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Dynamic Tree Embeddings in Butterflies and Hypercubes.
SIAM J. Comput., 1992

Maintaining Dynamic Ordered Sets on Processor Networks.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

A Framework for Analyzing Locality and Portability Issues in Parallel Computing.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Improved Multithreading Techniques for Hiding Communication Latency in Multiprocessors.
Proceedings of the 19th Annual International Symposium on Computer Architecture. Gold Coast, 1992

1991
How to Emulate Shared Memory.
J. Comput. Syst. Sci., 1991

Three-dimensional finite-element analyses: implications for computer architectures.
Proceedings of the Proceedings Supercomputing '91, 1991

1990
A Simulation-Based Comparison of Interconnection Networks.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

1987
The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton.
Proceedings of the International Conference on Parallel Processing, 1987

How to emulate shared memory (Preliminary Version)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
Interconnection Networks And Parallel Memory Organizations For Array Processing.
Proceedings of the International Conference on Parallel Processing, 1985


  Loading...