Vijaya Ramachandran

Orcid: 0000-0001-7561-5235

According to our database1, Vijaya Ramachandran authored at least 131 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computing Replacement Paths in the CONGEST Model.
Proceedings of the Structural Information and Communication Complexity, 2024

Computing Minimum Weight Cycle in the CONGEST Model.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Scalable Data Structures (Dagstuhl Seminar 23211).
Dagstuhl Reports, 2023

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model.
CoRR, 2023

2022
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model.
CoRR, 2022

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Scalable Data Structures (Dagstuhl Seminar 21071).
Dagstuhl Reports, 2021

2020
Data Oblivious Algorithms for Multicores.
IACR Cryptol. ePrint Arch., 2020

Faster Deterministic All Pairs Shortest Paths in Congest Model.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
A round-efficient distributed betweenness centrality algorithm.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Distributed Weighted All Pairs Shortest Paths Through Pipelining.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs.
ACM Trans. Algorithms, 2018

Editorial: ALENEX 2017 Special Issue.
ACM J. Exp. Algorithmics, 2018

New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths.
CoRR, 2018

A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining.
CoRR, 2018

Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths.
CoRR, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n<sup>3/2</sup>) Rounds.
CoRR, 2018

Fine-grained complexity for sparse graphs.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Resource Oblivious Sorting on Multicores.
ACM Trans. Parallel Comput., 2017

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers.
CoRR, 2017

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Randomized Minimum Spanning Tree.
Encyclopedia of Algorithms, 2016

Fine-Grained Complexity and Conditional Hardness for Sparse Graphs.
CoRR, 2016

Finding k Simple Shortest Paths and Cycles.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
A Faster Algorithm for Fully Dynamic Betweenness Centrality.
CoRR, 2015

Fully Dynamic Betweenness Centrality.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Fully Dynamic All Pairs All Shortest Paths.
CoRR, 2014

Betweenness Centrality - Incremental and Faster.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Oblivious algorithms for multicores and networks of processors.
J. Parallel Distributed Comput., 2013

Analysis of Randomized Work Stealing with False Sharing.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
Efficient Fetch-and-Increment.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Revisiting the Cache Miss Analysis of Multithreaded Algorithms.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Competitive Cache Replacement Strategies for Shared Cache Environments.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Efficient Resource Oblivious Algorithms for Multicores with False Sharing.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011
Efficient Resource Oblivious Algorithms for Multicores
CoRR, 2011

2010
Cache-Oblivious Dynamic Programming for Bioinformatics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation.
Theory Comput. Syst., 2010

A universal construction for wait-free transaction friendly data structures.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Oblivious algorithms for multicores and network of processors.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Flexible Hardware Acceleration for Instruction-Grain Lifeguards.
IEEE Micro, 2009

2008
Randomized Minimum Spanning Tree.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Randomized minimum spanning tree algorithms using exponentially fewer random bits.
ACM Trans. Algorithms, 2008

Oracles for Distances Avoiding a Failed Node or Link.
SIAM J. Comput., 2008

Parallelizing dynamic information flow tracking.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Cache-efficient dynamic programming algorithms for multicores.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Provably good multicore cache performance for divide-and-conquer algorithms.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Flexible Hardware Acceleration for Instruction-Grain Program Monitoring.
Proceedings of the 35th International Symposium on Computer Architecture (ISCA 2008), 2008

2007
The diameter of sparse random graphs.
Random Struct. Algorithms, 2007

The <i>k</i>-orientability thresholds for <i>G</i><sub><i>n, p</i></sub>.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Cache-Oblivious Computation: Algorithms and Experimental Evaluation.
Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007

2006
Pattern Identification in Biogeography.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Cache-oblivious dynamic programming.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
A Shortest Path Algorithm for Real-Weighted Undirected Graphs.
SIAM J. Comput., 2005

Pattern Identification in Biogeography.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

External-memory exact and approximate all-pairs shortest-paths in undirected graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Cache-oblivious shortest paths in graphs using buffer heap.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On contract-and-refine transformations between phylogenetic trees.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design.
J. Parallel Distributed Comput., 2003

Better Hill-Climbing Searches for Parsimony.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

A near optimal scheduler for switch-memory-switch routers.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest.
SIAM J. Comput., 2002

SPAA 1999 - Guest Editors' Foreword.
Theory Comput. Syst., 2002

An optimal minimum spanning tree algorithm.
J. ACM, 2002

Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence.
Algorithmica, 2002

Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution.
Proceedings of the 4th Joint Eurographics - IEEE TCVG Symposium on Visualization, 2002

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Computing shortest paths with comparisons and additions.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Distance Oracles for Avoiding Link-Failure.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Experimental Evaluation of a New Shortest Path Algorithm.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Parallel Algorithm Design with Coarse-Grained Synchronization.
Proceedings of the Computational Science - ICCS 2001, 2001

1999
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
Theory Comput. Syst., 1999

Modeling Parallel Bandwidth: Local versus Global Restrictions.
Algorithmica, 1999

Experimental Evaluation of QSM, a Simple Shared-Memory Model.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998
ERCW PRAMs and Optical Communication.
Theor. Comput. Sci., 1998

The Queue-Read Queue-Write Asynchronous PRAM Model.
Theor. Comput. Sci., 1998

The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms.
SIAM J. Comput., 1998

Computational Bounds for Fundamental Problems on General-Purpose Parallel Models.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997
Parallel Algorithms for Reducible Flow Graphs.
J. Algorithms, 1997

An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification.
Inf. Process. Lett., 1997

An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.
Algorithmica, 1997

Modeling Parallel Bandwidth: Local vs. Global Restrictions.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

QSM: A General Purpose Shared-Memory Model for Parallel Computation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems.
Proceedings of the Algorithms, 1997

1996
Efficient Massively Parallel Implementation of some Combinatorial Algorithms.
Theor. Comput. Sci., 1996

An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem.
SIAM J. Comput., 1996

Efficient Low-Contention Parallel Algorithms.
J. Comput. Syst. Sci., 1996

Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Computing Minimal Spanning Subgraphs in Linear Time.
SIAM J. Comput., 1995

On Finding Minimal Two-Connected Subgraphs.
J. Algorithms, 1995

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing.
Proceedings of IPPS '95, 1995

1994
Parallel Random Access Machines with both Multiplication and Shifts
Inf. Comput., April, 1994

Planarity Testing in Parallel.
J. Comput. Syst. Sci., 1994

Finding the Closed Partition of a Planar Graph.
Algorithmica, 1994

The QRQW PRAM: Accounting for Contention in Parallel Algorithms.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Parallel implementation of algorithms for finding connected components in graphs.
Proceedings of the Parallel Algorithms, 1994

The Design and Evaluation of Parallel Algorithms (Abstract).
Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993
Finding a Smallest Augmentation to Biconnect a Graph.
SIAM J. Comput., 1993

Finding Triconnected Components by Local Replacement.
SIAM J. Comput., 1993

1992
Multiplication, Division and Shift Instructions in Parallel Random Access Machines.
Theor. Comput. Sci., 1992

A new graph triconnectivity algorithm and its parallelization.
Comb., 1992

Implementation of Parallel Graph Algorithms on the MasPar.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
Improved Algorithms for Graph Four-Connectivity.
J. Comput. Syst. Sci., 1991

Transitive Compaction in Parallel via Branchings.
J. Algorithms, 1991

Parallel algorithm and complexity results for telephone link simulation.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

On Finding Minimal 2-Connected Subgraphs.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
A Minimax Arc Theorem for Reducible Flow Graphs.
SIAM J. Discret. Math., 1990

Linear Programming with Two Variables per Inequality in Poly-Log Time.
SIAM J. Comput., 1990

Lower Bounds for Parallel Computation on Linked Structures.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Parallel Algorithms for Shared-Memory Machines.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
A Framework for Parallel Graph Algorithm Design.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Finding Triconnected Components by Local Replacements.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

The Power of Parallel Random Access Machines with Augmented Instruction Sets.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits.
SIAM J. Comput., 1988

Finding a Minimum Feedback Arc Set in Reducible Flow Graphs.
J. Algorithms, 1988

Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles.
Algorithmica, 1988

Efficient Parallel Triconnectivity in Logarithmic Time.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
The complexity of minimum cut and maximum flow problems in an acyclic network.
Networks, 1987

1986
Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection.
IEEE Trans. Computers, 1986

On driving many long wires in a VLSI layout.
J. ACM, 1986

Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits.
Proceedings of the VLSI Algorithms and Architectures, 1986

1983
Single Residue Error Correction in Residue Number Systems.
IEEE Trans. Computers, 1983

An improved switch-level simulator for MOS circuits.
Proceedings of the 20th Design Automation Conference, 1983

1982
On Driving Many Long Lines in a VLSI Layout
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982


  Loading...