default search action
Vijay Ramachandran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c15]Saw Lin, Vijay Ramachandran, Tinotenda Zinyama:
Balancing overhead-minimization objectives in network probing-path selection. ISCC 2017: 353-358 - 2013
- [c14]Terrence Gibbons, Joshua Van Hook, Joy Na Wang, Thomas H. Shake, Dow Street, Vijay Ramachandran:
A Survey of Tactically Suitable Exterior Gateway Protocols. MILCOM 2013: 487-493 - [c13]Aaron D. Jaggard
, Swara Kopparty, Vijay Ramachandran, Rebecca N. Wright:
The design space of probing algorithms for network-performance measurement. SIGMETRICS 2013: 105-116 - 2012
- [c12]Vijay Ramachandran, Dow Street:
Pathsift: a library for separating the effects of topology, policy, and protocols on IP routing. SimuTools 2012: 65-74 - 2011
- [j3]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. Distributed Comput. 23(5-6): 301-319 (2011)
2000 – 2009
- 2009
- [c11]Aaron D. Jaggard
The Impact of Communication Models on Routing-Algorithm Convergence. ICDCS 2009: 58-67 - 2008
- [c10]Sharon Goldberg, Shai Halevi, Aaron D. Jaggard
Rationality and traffic attraction: incentives for honest path announcements in bgp. SIGCOMM 2008: 267-278 - 2007
- [c9]Cheng Tien Ee, Vijay Ramachandran, Byung-Gon Chun, Kaushik Lakshminarayanan, Scott Shenker
Resolving inter-domain policy disputes. SIGCOMM 2007: 157-168 - 2006
- [j2]Biren Shah, Vijay Ramachandran, Karthik Ramachandran:
A Hybrid Approach for Data Warehouse View Selection. Int. J. Data Warehous. Min. 2(2): 1-37 (2006) - [c8]Aaron D. Jaggard
Robust Path-Vector Routing Despite Inconsistent Route Preferences. ICNP 2006: 270-279 - [c7]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. EC 2006: 130-139 - 2005
- [j1]Aaron D. Jaggard
Toward the design of robust interdomain routing protocols. IEEE Netw. 19(6): 35-41 (2005) - [c6]Aaron D. Jaggard, Vijay Ramachandran:
Relating two formal models of path-vector routing. INFOCOM 2005: 619-630 - 2004
- [c5]Aaron D. Jaggard, Vijay Ramachandran:
Robustness of Class-Based Path-Vector Systems. ICNP 2004: 84-93 - 2003
- [c4]Timothy Griffin, Aaron D. Jaggard, Vijay Ramachandran:
Design principles of policy languages for path vector protocols. SIGCOMM 2003: 61-72 - 2001
- [c3]Ming-Yang Kao, Vijay Ramachandran:
DNA Self-Assembly For Constructing 3D Boxes. ISAAC 2001: 429-440 - [i1]Ming-Yang Kao, Vijay Ramachandran:
DNA Self-Assembly For Constructing 3D Boxes. CoRR cs.CC/0112009 (2001) - 2000
- [c2]Kevin Chen, Vijay Ramachandran:
A Space-Efficient Randomized DNA Algorithm for k-SAT. DNA Computing 2000: 199-208 - [c1]Vijay Ramachandran, Raju Pandey, S.-H. Gary Chan:
Fair resource allocation in active networks. ICCCN 2000: 468-475
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:41 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: