default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenry D. Shapiro
Person information
- affiliation: University of New Mexico, Albuquerque, NM, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j9]Bernard M. E. Moret, Henry D. Shapiro:
Algorithms and Experiments: The New (and Old) Methodology. J. Univers. Comput. Sci. 7(5): 434-446 (2001)
1990 – 1999
- 1999
- [j8]George Kvernadze, Thomas M. Hagstrom
, Henry D. Shapiro:
Locating Discontinuities of a Bounded Function by the Partial Sums of Its Fourier Series. J. Sci. Comput. 14(4): 301-327 (1999) - 1993
- [j7]Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. SIAM J. Discret. Math. 6(2): 274-283 (1993) - 1992
- [j6]Lane H. Clark, Roger C. Entringer, Henry D. Shapiro:
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8(3): 225-231 (1992) - [c8]Bernard M. E. Moret, Henry D. Shapiro:
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree. Computational Support for Discrete Mathematics 1992: 99-117 - [c7]Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. IPCO 1992: 287-297 - 1991
- [j5]Craig A. Morgenstern, Henry D. Shapiro:
Heuristics for Rapidly Four-Coloring Large Planar Graphs. Algorithmica 6(6): 869-891 (1991) - [c6]Bernard M. E. Moret, Henry D. Shapiro:
How to Find a Minimum Spanning Tree in Practice. New Results and New Trends in Computer Science 1991: 192-203 - [c5]Bernard M. E. Moret, Henry D. Shapiro:
An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. WADS 1991: 400-411
1980 – 1989
- 1986
- [c4]Raymond A. Archuleta, Henry D. Shapiro:
A Fast Probabilistic Algorithm for Four-Coloring Large Planar Graphs. FJCC 1986: 595-599 - [c3]Henry D. Shapiro, B. V. Randall:
Microcomputer technology for drilling. Workshop on Applied Computing 1986: 13-20 - 1984
- [j4]Henry D. Shapiro:
Increasing robustness in global adaptive quadrature through interval selection heuristics. ACM Trans. Math. Softw. 10(2): 117-139 (1984) - 1980
- [j3]Henry D. Shapiro:
The results of an informal study to evaluate the effectiveness of teaching structured programming. ACM SIGCSE Bull. 12(4): 50-56 (1980)
1970 – 1979
- 1979
- [c2]Bruce D. Link, Henry D. Shapiro:
TSEM, a flexible scenario based small forces model. WSC 1979: 331-345 - 1978
- [j2]Henry D. Shapiro:
Generalized Latin squares on the torus. Discret. Math. 24(1): 63-77 (1978) - [j1]Henry D. Shapiro:
Theoretical Limitations on the Efficient Use of Parallel Memories. IEEE Trans. Computers 27(5): 421-428 (1978) - 1976
- [b1]Henry D. Shapiro:
Theoretical Limitations on the Use of Parallel Memories. University of Illinois Urbana-Champaign, USA, 1976 - [c1]Henry D. Shapiro, M. Dennis Mickunas:
A new approach to teaching a first course in compiler construction. SIGCSE-SIGCUE 1976: 158-166
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-04-24 23:14 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:
