default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinayak Pathak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Hassan Ashtiani, Vinayak Pathak, Ruth Urner:
Adversarially Robust Learning with Tolerance. ALT 2023: 115-135- [c8]Tosca Lechner, Vinayak Pathak, Ruth Urner:
Adversarially Robust Learning with Uncertain Perturbation Sets. NeurIPS 2023 - 2022
- [c7]Shiqi Xu, Xiang Dai
, Xi Yang, Kevin C. Zhou, Kanghyun Kim, Vinayak Pathak, Carolyn Glass, Roarke Horstmeyer:
Tensorial tomographic differential phase-contrast microscopy. ICCP 2022: 1-11 - [i9]Hassan Ashtiani, Vinayak Pathak, Ruth Urner:
Adversarially Robust Learning with Tolerance. CoRR abs/2203.00849 (2022) - [i8]Shiqi Xu, Xiang Dai, Xi Yang, Kevin C. Zhou, Kanghyun Kim, Vinayak Pathak, Carolyn Glass, Roarke Horstmeyer:
Tensorial tomographic differential phase-contrast microscopy. CoRR abs/2204.11397 (2022) - 2021
- [i7]Xing Yao, Vinayak Pathak, Haoran Xi, Amey Chaware, Colin L. V. Cooke, Kanghyun Kim, Shiqi Xu, Yuting Li, Timothy Dunn, Pavan Chandra Konda, Kevin C. Zhou, Roarke Horstmeyer:
Increasing a microscope's effective field of view via overlapped imaging and machine learning. CoRR abs/2110.04921 (2021) - 2020
- [c6]Hassan Ashtiani, Vinayak Pathak, Ruth Urner:
Black-box Certification and Learning under Adversarial Perturbations. ICML 2020: 388-398 - [i6]Hassan Ashtiani, Vinayak Pathak, Ruth Urner:
Black-box Certification and Learning under Adversarial Perturbations. CoRR abs/2006.16520 (2020)
2010 – 2019
- 2018
- [j4]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping edge-labelled triangulations. Comput. Geom. 68: 309-326 (2018) - 2017
- [j3]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. SIAM J. Discret. Math. 31(3): 2185-2200 (2017) - 2016
- [i5]Anna Lubiw, Vinayak Pathak:
Reconfiguring Ordered Bases of a Matroid. CoRR abs/1612.00958 (2016) - 2015
- [j2]Anna Lubiw, Vinayak Pathak:
Flip distance between two triangulations of a point set is NP-complete. Comput. Geom. 49: 17-23 (2015) - [c5]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) 2015: 985-996 - 2014
- [j1]Timothy M. Chan, Vinayak Pathak:
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. Comput. Geom. 47(2): 240-247 (2014) - [i4]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR abs/1404.3801 (2014) - 2013
- [c4]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [i3]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-Approaching Graphs. CoRR abs/1306.5460 (2013) - [i2]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping Edge-Labelled Triangulations. CoRR abs/1310.1166 (2013) - 2012
- [c3]Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point Set is NP-complete. CCCG 2012: 119-124 - [c2]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. GD 2012: 260-271 - [i1]Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point-Set is NP-complete. CoRR abs/1205.2425 (2012) - 2011
- [c1]Timothy M. Chan, Vinayak Pathak:
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. WADS 2011: 195-206
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 22:18 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:
