default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamesh Viswanathan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c23]Rui Abreu, Franjo Ivancic, Filip Niksic, Hadi Ravanbakhsh, Ramesh Viswanathan:
Reducing Time-To-Fix For Fuzzer Bugs. ASE 2021: 1126-1130
2010 – 2019
- 2014
- [j7]Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan:
Least upper bounds for probability measures and their applications to abstractions. Inf. Comput. 234: 68-106 (2014) - 2012
- [j6]Fangzhe Chang, Peter S. Fales, Moritz Steiner, Ramesh Viswanathan, Thomas J. Williams, Thomas L. Wood:
Mitigating High Latency Outliers for Cloud-Based Telecommunication Services. Bell Labs Tech. J. 17(2): 121-142 (2012) - [c22]Fangzhe Chang, Ramesh Viswanathan, Tom L. Wood:
Placement in Clouds for Application-Level Latency Requirements. IEEE CLOUD 2012: 327-335 - [c21]Adiseshu Hari, Ramesh Viswanathan, T. V. Lakshman, Y. J. Chang:
The Personal Cloud - Design, Architecture and Matchmaking Algorithms for Resource Management. Hot-ICE 2012 - 2011
- [j5]Ramesh Viswanathan, Krishan K. Sabnani, Robert J. Holt, Arun N. Netravali:
Expected convergence properties of BGP. Comput. Networks 55(8): 1957-1981 (2011) - [c20]Fangzhe Chang, Pavithra Prabhakar, Ramesh Viswanathan:
Behavior Based Service Composition. WS-FM 2011: 17-31 - 2010
- [c19]Fangzhe Chang, Jennifer Ren, Ramesh Viswanathan:
Optimal Resource Allocation in Clouds. IEEE CLOUD 2010: 418-425
2000 – 2009
- 2009
- [c18]Fangzhe Chang, Jennifer Ren, Ramesh Viswanathan:
Optimal Resource Allocation for Batch Testing. ICST 2009: 91-100 - 2008
- [j4]Ramesh Viswanathan, Thomas L. Wood:
Portable Call Agent: A model for rapid development and emulation of network services. Bell Labs Tech. J. 12(4): 159-172 (2008) - [c17]Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan:
Least Upper Bounds for Probability Measures and Their Applications to Abstractions. CONCUR 2008: 264-278 - 2005
- [c16]Lalita Jategaonkar Jagadeesan, Ramesh Viswanathan:
Passive mid-stream monitoring of real-time properties. EMSOFT 2005: 343-352 - [c15]Amogh Kavimandan, Wonsuck Lee, Marina Thottan, Aniruddha S. Gokhale
, Ramesh Viswanathan:
Network simulation via hybrid system modeling: a time-stepped approach. ICCCN 2005: 531-536 - [c14]Ramesh Viswanathan, Krishan K. Sabnani, Robert J. Holt, Arun N. Netravali:
Expected Convergence Properties of BGP. ICNP 2005: 3-15 - [c13]Ramesh Viswanathan, Jing (Tiffany) Li, Mooi Choo Chuah:
Message Ferrying for Constrained Scenarios. WOWMOM 2005: 487-489 - 2004
- [c12]Mahesh Viswanathan, Ramesh Viswanathan:
A Higher Order Modal Fixed Point Logic. CONCUR 2004: 512-528 - [c11]Ruiyuan Hu, Ramesh Viswanathan, Jing Li:
A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding. GLOBECOM 2004: 51-55 - 2003
- [j3]Daniel G. Waddington, Fangzhe Chang, Ramesh Viswanathan, Bin Yao:
Topology discovery for public IPv6 networks. Comput. Commun. Rev. 33(3): 59-68 (2003) - [c10]Arun N. Netravali, Krishan K. Sabnani, Ramesh Viswanathan:
Correct Passive Testing Algorithms and Complete Fault Coverage. FORTE 2003: 303-318 - [c9]Bin Yao, Ramesh Viswanathan, Fangzhe Chang, Daniel G. Waddington:
Topology Inference in the Presence of Anonymous Routers. INFOCOM 2003: 353-363 - 2002
- [j2]Dan G. Waddington, Ramesh Viswanathan:
Interaction points: exploiting operating system mechanisms for inter-component communications. ACM SIGOPS Oper. Syst. Rev. 36(2): 19-35 (2002) - 2001
- [c8]Mahesh Viswanathan, Ramesh Viswanathan:
Foundations for Circular Compositional Reasoning. ICALP 2001: 835-847
1990 – 1999
- 1999
- [c7]Masum Hasan, Binay Sugla, Ramesh Viswanathan:
A Conceptual Framework for Network Management Event Correlation and Filtering Systems. Integrated Network Management 1999: 233-246 - [c6]Allen Ginsberg, Ramesh Viswanathan:
A calculus for dynamic customization of virtual environments. ACM Multimedia (1) 1999: 47-56 - 1998
- [c5]Ramesh Viswanathan:
Full Abstraction for First-Order Objects with Recursive Types and Subtyping. LICS 1998: 380-391 - 1996
- [j1]John C. Mitchell, Ramesh Viswanathan:
Standard ML-NJ Weak Polymorphism and Imperative Constructs. Inf. Comput. 127(2): 102-116 (1996) - [c4]John C. Mitchell, Ramesh Viswanathan:
Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract). ICALP 1996: 170-181 - [c3]Martín Abadi, Luca Cardelli, Ramesh Viswanathan:
An Interpretation of Objects and Object Types. POPL 1996: 396-409 - 1995
- [b1]Ramesh Viswanathan:
Recursion theoretic semantics, fully abstract term models, and imperative constructs. Stanford University, USA, 1995 - [c2]Jon G. Riecke, Ramesh Viswanathan:
Isolating Side Effects in Sequential Languages. POPL 1995: 1-12 - 1993
- [c1]My Hoang, John C. Mitchell, Ramesh Viswanathan:
Standard ML-NJ weak polymorphism and imperative constructs. LICS 1993: 15-25
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-24 22:59 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:
