default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil Lutz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Neil Lutz, Donald M. Stull:
Projection theorems using effective dimension. Inf. Comput. 297: 105137 (2024)- 2023
- [j8]Jack H. Lutz, Neil Lutz, Elvira Mayordomo
:
Extending the reach of the point-to-set principle. Inf. Comput. 294: 105078 (2023) - [j7]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Dimension and the Structure of Complexity Classes. Theory Comput. Syst. 67(3): 473-490 (2023) - 2022
- [j6]Neil Lutz, Donald M. Stull:
Dimension spectra of lines. Comput. 11(2): 85-112 (2022) - [c13]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Extending the Reach of the Point-To-Set Principle. STACS 2022: 48:1-48:14 - 2021
- [j5]Neil Lutz:
Fractal Intersections and Products via Algorithmic Dimension. ACM Trans. Comput. Theory 13(3): 14:1-14:15 (2021) - [i18]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Dimension and the Structure of Complexity Classes. CoRR abs/2109.05956 (2021) - 2020
- [j4]Neil Lutz, Donald M. Stull:
Bounding the dimension of points on a line. Inf. Comput. 275: 104601 (2020) - [c12]Jack H. Lutz, Neil Lutz:
Who Asked Us? How the Theory of Computing Answers Questions about Analysis. Complexity and Approximation 2020: 48-56 - [c11]Christopher Jung, Sampath Kannan, Neil Lutz:
Service in Your Neighborhood: Fairness in Center Location. FORC 2020: 5:1-5:15 - [c10]Christopher Jung, Sampath Kannan, Neil Lutz:
Quantifying the Burden of Exploration and the Unfairness of Free Riding. SODA 2020: 1892-1904 - [i17]Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
The Dimensions of Hyperspaces. CoRR abs/2004.07798 (2020) - [i16]Jack H. Lutz, Neil Lutz:
Algorithmically Optimal Outer Measures. CoRR abs/2006.08468 (2020)
2010 – 2019
- 2019
- [c9]Jack H. Lutz, Neil Lutz, Robyn R. Lutz, Matthew R. Riley:
Robustness and games against nature in molecular programming. ICSE (NIER) 2019: 65-68 - [i15]Jack H. Lutz, Neil Lutz, Robyn R. Lutz, Matthew R. Riley:
Robustness and Games Against Nature in Molecular Programming. CoRR abs/1902.06171 (2019) - [i14]Christopher Jung, Sampath Kannan, Neil Lutz:
A Center in Your Neighborhood: Fairness in Facility Location. CoRR abs/1908.09041 (2019) - [i13]Jack H. Lutz, Neil Lutz:
Who Asked Us? How the Theory of Computing Answers Questions about Analysis. CoRR abs/1912.00284 (2019) - 2018
- [j3]Jack H. Lutz, Neil Lutz:
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. ACM Trans. Comput. Theory 10(2): 7:1-7:22 (2018) - [c8]Neil Lutz, Donald M. Stull:
Projection Theorems Using Effective Dimension. MFCS 2018: 71:1-71:15 - [i12]Christopher Jung, Sampath Kannan, Neil Lutz:
Quantifying the Burden of Exploration and the Unfairness of Free Riding. CoRR abs/1810.08743 (2018) - 2017
- [j2]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Dynamics at the Boundary of Game Theory and Distributed Computing. ACM Trans. Economics and Comput. 5(3): 15:1-15:20 (2017) - [c7]Neil Lutz, Donald M. Stull:
Dimension Spectra of Lines. CiE 2017: 304-314 - [c6]Neil Lutz:
Fractal Intersections and Products via Algorithmic Dimension. MFCS 2017: 58:1-58:12 - [c5]Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. PODC 2017: 419-421 - [c4]Jack H. Lutz, Neil Lutz:
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. STACS 2017: 53:1-53:13 - [c3]Neil Lutz, Donald M. Stull:
Bounding the Dimension of Points on a Line. TAMC 2017: 425-439 - [i11]Neil Lutz, Donald M. Stull:
Dimension Spectra of Lines. CoRR abs/1701.04108 (2017) - [i10]Neil Lutz, Donald M. Stull:
Projection Theorems Using Effective Dimension. CoRR abs/1711.02124 (2017) - 2016
- [i9]Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. CoRR abs/1611.10068 (2016) - [i8]Neil Lutz, Donald M. Stull:
Bounding the Dimension of Points on a Line. CoRR abs/1612.00143 (2016) - [i7]Neil Lutz:
Fractal Intersections and Products via Algorithmic Dimension. CoRR abs/1612.01659 (2016) - [i6]Neil Lutz:
A Note on Pointwise Dimensions. CoRR abs/1612.05849 (2016) - 2015
- [j1]Jack H. Lutz, Neil Lutz:
Lines missing every random point. Comput. 4(2): 85-102 (2015) - [i5]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Dynamics at the Boundary of Game Theory and Distributed Computing. CoRR abs/1509.02955 (2015) - [i4]Jack H. Lutz, Neil Lutz:
Algorithmic information and plane Kakeya sets. CoRR abs/1511.00442 (2015) - 2014
- [c2]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. CiE 2014: 283-292 - [c1]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Self-stabilizing Uncoupled Dynamics. SAGT 2014: 74-85 - [i3]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. CoRR abs/1401.3063 (2014) - [i2]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Self-stabilizing uncoupled dynamics. CoRR abs/1403.5791 (2014) - [i1]Jack H. Lutz, Neil Lutz:
Lines Missing Every Random Point. Electron. Colloquium Comput. Complex. TR14 (2014)
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-06-11 21:45 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:
