default search action
Arvind Raghunathan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Chandrasekhar Manchiraju
, Milind Dawande
Dynamic Pricing and Capacity Optimization in Railways. Manuf. Serv. Oper. Manag. 26(1): 350-369 (2024)
2010 – 2019
- 2014
- [c10]Oncel Tuzel, Ming-Yu Liu, Yuichi Taguchi, Arvind Raghunathan:
Learning to Rank 3D Features. ECCV (1) 2014: 520-535 - 2011
- [c9]Ashutosh Tewari, Michael Giering, Arvind Raghunathan:
Parametric Characterization of Multimodal Distributions with Non-gaussian Modes. ICDM Workshops 2011: 286-292
1990 – 1999
- 1994
- [j7]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
On-Line Algorithms for Locating Checkpoints. Algorithmica 11(1): 33-52 (1994) - [j6]Charles U. Martel, Arvind Raghunathan:
Asynchronous PRAMs with Memory Latency. J. Parallel Distributed Comput. 23(1): 10-26 (1994) - 1993
- [c8]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan:
On-line algorithms for cache sharing. STOC 1993: 422-430 - 1992
- [j5]Sanjoy K. Baruah, Gilad Koren, Decao Mao, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha, Fuxing Wang:
On the Competitiveness of On-Line Real-Time Task Scheduling. Real Time Syst. 4(2): 125-144 (1992) - [j4]Donald E. Knuth, Arvind Raghunathan:
The Problem of Compatible Representatives. SIAM J. Discret. Math. 5(3): 422-427 (1992) - 1991
- [c7]Sanjoy K. Baruah, Gilad Koren, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha:
On-line Scheduling in the Presence of Overload. FOCS 1991: 100-110 - [c6]Arvind Raghunathan, Huzur Saran:
Is the Shuffle-Exchange Better Than the Butterfly? ISA 1991: 32-41 - [c5]Sanjoy K. Baruah, Gilad Koren, Decao Mao, Bud Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha, Fuxing Wang:
On the competitiveness of on-line real-time task scheduling. RTSS 1991: 106-115 - 1990
- [j3]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. J. Comput. Syst. Sci. 40(1): 19-48 (1990) - [c4]Richard Cole, Arvind Raghunathan:
Online Algorithms for Finger Searching (Extended Abstract). FOCS 1990: 480-489 - [c3]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
Online Algorithms for Locating Checkpoints. STOC 1990: 359-368
1980 – 1989
- 1989
- [j2]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Perfect Graphs and Orthogonally Convex Covers. SIAM J. Discret. Math. 2(3): 371-392 (1989) - 1988
- [c2]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. SCG 1988: 211-223 - [c1]Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Constructive Results from Graph Minors: Linkless Embeddings. FOCS 1988: 398-409 - 1987
- [j1]Bayya Yegnanarayana, Arvind Raghunathan:
Representation of images through group-delay functions. IEEE Trans. Acoust. Speech Signal Process. 35(2): 237-240 (1987)
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-10-07 21:19 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: