default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Bunton
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Jonathan Bunton, Paulo Tabuada:
Confidently Incorrect: Nonlinear Observers with Online Error Bounds. ACC 2024: 4729-4734- [c7]Matteo Marchi, Jonathan Bunton, João Pedro Silvestre, Paulo Tabuada:
A Framework for Time-Varying Optimization via Derivative Estimation. ECC 2024: 2730-2735 - [i3]Matteo Marchi, Jonathan Bunton, João Pedro Silvestre, Paulo Tabuada:
A Framework for Time-Varying Optimization via Derivative Estimation. CoRR abs/2403.19088 (2024) - 2023
- [j4]Matteo Marchi
, Jonathan Bunton, Yskandar Gas, Bahman Gharesifard, Paulo Tabuada:
Sharp Performance Bounds for PASTA. IEEE Control. Syst. Lett. 7: 2401-2406 (2023) - [j3]Pradipta Ghosh, Jonathan Bunton, Dimitrios Pylorof, Marcos A. M. Vieira, Kevin Chan, Ramesh Govindan, Gaurav S. Sukhatme, Paulo Tabuada, Gunjan Verma:
Synthesis of Large-Scale Instant IoT Networks. IEEE Trans. Mob. Comput. 22(3): 1810-1824 (2023) - 2022
- [j2]Matteo Marchi, Jonathan Bunton, Bahman Gharesifard, Paulo Tabuada:
Safety and Stability Guarantees for Control Loops With Deep Learning Perception. IEEE Control. Syst. Lett. 6: 1286-1291 (2022) - [j1]Jonathan Bunton, Paulo Tabuada:
Joint Continuous and Discrete Model Selection via Submodularity. J. Mach. Learn. Res. 23: 329:1-329:42 (2022) - [c6]Matteo Marchi, Jonathan Bunton, Bahman Gharesifard, Paulo Tabuada:
LiDAR Point Cloud Registration with Formal Guarantees. CDC 2022: 3462-3467 - [c5]Jonathan Bunton, Paulo Tabuada:
Give the problem a lift: solving quadratic programs with combinatorial costs. CDC 2022: 6941-6946 - 2021
- [c4]Jonathan Bunton, Tzanis Anevlavis, Gunjan Verma, Christina Fragouli, Paulo Tabuada:
Split to win: near-optimal sensor network synthesis via path-greedy subproblems. MILCOM 2021: 789-794 - [i2]Jonathan Bunton, Paulo Tabuada:
Joint Continuous and Discrete Model Selection via Submodularity. CoRR abs/2102.09029 (2021) - 2020
- [c3]Tzanis Anevlavis, Jonathan Bunton, Anjaly Parayil, Jemin George, Paulo Tabuada:
To beam or not to beam? Beamforming with submodularity-inspired group sparsity. CDC 2020: 390-395 - [c2]Jonathan Bunton, Paulo Tabuada:
Why not both? Exact continuous and discrete optimization with submodularity. CDC 2020: 4842-4847 - [c1]Pradipta Ghosh, Jonathan Bunton, Dimitrios Pylorof, Marcos Augusto M. Vieira, Kevin Chan, Ramesh Govindan, Gaurav S. Sukhatme, Paulo Tabuada, Gunjan Verma:
Rapid Top-Down Synthesis of Large-Scale IoT Networks. ICCCN 2020: 1-9 - [i1]Pradipta Ghosh, Jonathan Bunton, Dimitrios Pylorof, Marcos Augusto M. Vieira, Kevin S. Chan, Ramesh Govindan, Gaurav S. Sukhatme, Paulo Tabuada, Gunjan Verma:
Rapid Top-Down Synthesis of Large-Scale IoT Networks. CoRR abs/2002.04244 (2020)
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 2025-01-07 01:19 CET 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:
