default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Reid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]An T. N. Dang
, Lalit Kumar, Michael Reid, Lu N. T. Anh:
Modelling the susceptibility of wetland plant species under climate change in the Mekong Delta, Vietnam. Ecol. Informatics 64: 101358 (2021)- [j18]An T. N. Dang, Lalit Kumar, Michael Reid, Ho Nguyen:
Remote Sensing Approach for Monitoring Coastal Wetland in the Mekong Delta, Vietnam: Change Trends and Their Driving Forces. Remote. Sens. 13(17): 3359 (2021) - [j17]Claudia Post, Simon Brülisauer, Kryss Waldschläger, William Hug, Luis Grüneis, Niklas Heyden, Sebastian Schmor, Aaron Förderer, Ray Reid, Michael Reid, Rohit Bhartia, Quoc Nguyen, Holger Schüttrumpf, Florian Amann:
Application of Laser-Induced, Deep UV Raman Spectroscopy and Artificial Intelligence in Real-Time Environmental Monitoring - Solutions and First Results. Sensors 21(11): 3911 (2021)
2010 – 2019
- 2012
- [j16]Michael Reid, Maurice N. Collins, Eric E. Dalton, Jeff M. Punch, David A. Tanner:
Testing method for measuring corrosion resistance of surface mount chip resistors. Microelectron. Reliab. 52(7): 1420-1427 (2012) - 2010
- [j15]Dominik Herkommer, Jeff M. Punch, Michael Reid:
A reliability model for SAC solder covering isothermal mechanical cycling and thermal cycling conditions. Microelectron. Reliab. 50(1): 116-126 (2010)
2000 – 2009
- 2008
- [j14]Michael Reid:
Parity and tiling by trominoes. Australas. J Comb. 40: 115-136 (2008) - [j13]Michael Reid:
Asymptotically Optimal Box Packing Theorems. Electron. J. Comb. 15(1) (2008) - 2006
- [j12]H. A. ShahAli, Michael Reid:
Powers of Consecutive Integers: 11121. Am. Math. Mon. 113(7): 659-660 (2006) - 2005
- [j11]Michael Reid:
Klarner systems and tiling boxes with polyominoes. J. Comb. Theory A 111(1): 89-105 (2005) - 2002
- [j10]Szilárd András, Michael Reid:
Arithmetic Means and Geometric Means: 10907. Am. Math. Mon. 109(10): 924-925 (2002) - 2001
- [j9]Richard E. Korf, Michael Reid, Stefan Edelkamp:
Time complexity of iterative-deepening-A*. Artif. Intell. 129(1-2): 199-218 (2001) - [j8]Louis W. Shapiro, Richard Ehrenborg, John W. Moon, Michael Reid:
Leaves of Ordered Trees: 10753. Am. Math. Mon. 108(9): 873-874 (2001) - 2000
- [j7]Robert Hochberg, Michael Reid:
Tiling with notched cubes. Discret. Math. 214(1-3): 255-261 (2000) - [j6]Wu Wei Chao, Michael Reid, F. Bellot Rosado, Robin J. Chapman, Daniele Donini, Shalosh B. Ekhad, N. Lakshmanan, O. P. Lossers, Albert Nijenhuis, Peter Nüesch, C. G. Petalas:
Incenters and Excenters: 10693. Am. Math. Mon. 107(2): 182-184 (2000)
1990 – 1999
- 1998
- [j5]Michael Reid:
Tiling a Square with Eight Congruent Polyominoes. J. Comb. Theory A 83(1): 158 (1998) - [c1]Richard E. Korf, Michael Reid:
Complexity Analysis of Admissible Heuristic Search. AAAI/IAAI 1998: 305-310 - 1997
- [j4]Michael Reid:
Tiling Rectangles and Half Strips with Congruent Polyominoes. J. Comb. Theory A 80(1): 106-123 (1997) - 1996
- [j3]Michael Reid:
On the connectivity of unit distance graphs. Graphs Comb. 12(1): 295-303 (1996) - 1993
- [j2]George Miminis, Michael Reid:
Algorithm 718: A FORTRAN subroutine to solve the eigenvalue allocation problem for single-input systems. ACM Trans. Math. Softw. 19(2): 224-232 (1993) - 1990
- [j1]Michael Reid, Douglas S. Jungreis, Dave Witte:
Distances forbidden by some two-coloring of Q2. Discret. Math. 82(1): 53-56 (1990)
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-10 21:25 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:
