default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Newman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Rahul Awasthy, Meetu Malhotra, Michael L. Seavers, Mark Newman:
Admission prioritization of heart failure patients with multiple comorbidities. Frontiers Digit. Health 6 (2024)- [i1]Dmitri Tymoczko, Mark Newman:
Computational music analysis from first principles. CoRR abs/2407.21130 (2024) - 2023
- [j7]Billie S. Anderson
, Mark Newman, Philip A. Grim II, J. Michael Hardin:
A Monte Carlo simulation framework for reject inference. J. Oper. Res. Soc. 74(4): 1133-1149 (2023)
2010 – 2019
- 2018
- [j6]Xiruo Ding, Ziad Gellad, III Chad Mather, Pamela Barth, Eric G. Poon, Mark Newman, Benjamin Alan Goldstein:
Designing risk prediction models for ambulatory no-shows across different specialties and clinics. J. Am. Medical Informatics Assoc. 25(8): 924-930 (2018) - [c5]Laurel Lord, John Sell, Feyzi Bagirov, Mark Newman:
Survival Analysis within Stack Overflow: Python and R. Innovate-Data 2018: 51-59 - 2010
- [j5]Mark Newman:
Beyond Structural Realism: pluralist criteria for theory evaluation. Synth. 174(3): 413-443 (2010) - [j4]Mark Newman:
The No-Miracles Argument, reliabilism, and a methodological version of the generality problem. Synth. 177(1): 111-138 (2010)
2000 – 2009
- 2006
- [j3]Danny Dorling, Anna Barford, Mark Newman:
Worldmapper: The World as You've Never Seen it Before. IEEE Trans. Vis. Comput. Graph. 12(5): 757-764 (2006)
1990 – 1999
- 1992
- [j2]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM J. Comput. 21(4): 639-654 (1992) - 1991
- [j1]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. Math. Syst. Theory 24(4): 253-271 (1991) - 1990
- [c4]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990: 55-64
1980 – 1989
- 1989
- [c3]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989: 224-234 - [c2]Johan Håstad, Frank Thomson Leighton, Mark Newman:
Fast Computation Using Faulty Hypercubes (Extended Abstract). STOC 1989: 251-263 - 1987
- [c1]Johan Håstad, Frank Thomson Leighton, Mark Newman:
Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract). STOC 1987: 274-284
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: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:
