Giridhar Pemmasani

According to our database, Giridhar Pemmasani authored at least 4 papers between 2001 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Lowest common ancestors in trees and directed acyclic graphs.

Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin

J. Algorithms, 2005

2003

Online Justification for Tabled Logic Programs.

Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan

Proceedings of the Logic Programming, 19th International Conference, 2003

2002

Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints.

Giridhar Pemmasani, C. R. Ramakrishnan, I. V. Ramakrishnan

Proceedings of the Logic Programming, 18th International Conference, 2002

2001

Finding least common ancestors in directed acyclic graphs.

Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001