default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShmuel Weinberger
Person information
- affiliation: University of Chicago, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Ben Knudsen, Shmuel Weinberger
:
Analog Category and Complexity. SIAM J. Appl. Algebra Geom. 8(3): 713-732 (2024)- 2023
- [j11]Daniel C. Cohen, Michael Farber, Shmuel Weinberger:
Correction to: Parametrized topological complexity of collision‑free motion planning in the plane. Ann. Math. Artif. Intell. 91(1): 105-106 (2023) - 2022
- [j10]Daniel C. Cohen, Michael Farber, Shmuel Weinberger:
Parametrized topological complexity of collision-free motion planning in the plane. Ann. Math. Artif. Intell. 90(10): 999-1015 (2022) - [c1]Michael Farber, Shmuel Weinberger:
Parametrized Motion Planning and Topological Complexity. WAFR 2022: 1-17 - [i3]Michael Farber, Shmuel Weinberger:
Parametrized motion planning and topological complexity. CoRR abs/2202.05801 (2022) - 2021
- [j9]Daniel C. Cohen, Michael Farber, Shmuel Weinberger:
Topology of Parametrized Motion Planning Algorithms. SIAM J. Appl. Algebra Geom. 5(2): 229-249 (2021) - 2020
- [j8]Sergio Rajsbaum, Shmuel Weinberger:
Geometric and Topological Methods in Computer Science (special 10th anniversary GETCO conference, 2018). J. Appl. Comput. Topol. 4(1): 1-2 (2020) - [i2]Daniel C. Cohen, Michael Farber, Shmuel Weinberger:
Parametrized topological complexity of collision-free motion planning in the plane. CoRR abs/2010.09809 (2020)
2010 – 2019
- 2019
- [j7]Shmuel Weinberger:
Interpolation, the Rudimentary Geometry of Spaces of Lipschitz Functions, and Geometric Complexity. Found. Comput. Math. 19(5): 991-1011 (2019) - 2018
- [i1]Fedor Manin, Shmuel Weinberger:
Algorithmic aspects of immersibility and embeddability. CoRR abs/1812.09413 (2018) - 2017
- [j6]Omer Bobrowski, Shmuel Weinberger:
On the vanishing of homology in random Čech complexes. Random Struct. Algorithms 51(1): 14-51 (2017) - 2014
- [j5]Robert J. Adler, Omer Bobrowski, Shmuel Weinberger:
Crackle: The Homology of Noise. Discret. Comput. Geom. 52(4): 680-704 (2014) - [j4]Shmuel Weinberger:
The Complexity of Some Topological Inference Problems. Found. Comput. Math. 14(6): 1277-1285 (2014) - 2011
- [j3]Partha Niyogi, Stephen Smale, Shmuel Weinberger:
A Topological View of Unsupervised Learning from Noisy Data. SIAM J. Comput. 40(3): 646-663 (2011)
2000 – 2009
- 2008
- [j2]Partha Niyogi, Stephen Smale, Shmuel Weinberger:
Finding the Homology of Submanifolds with High Confidence from Random Samples. Discret. Comput. Geom. 39(1-3): 419-441 (2008) - 2004
- [j1]Shmuel Weinberger:
On the topological social choice model. J. Econ. Theory 115(2): 377-384 (2004)
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-04 20:57 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:
