default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael B. Smyth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j17]Michael B. Smyth, Rueiher Tsaur, Iain Stewart:
Topological graph dimension. Discret. Math. 310(2): 325-329 (2010)
2000 – 2009
- 2008
- [j16]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen:
Foreword. Theor. Comput. Sci. 405(1-2): 1-2 (2008) - 2007
- [p1]Michael B. Smyth, Julian Webster:
Discrete Spatial Models. Handbook of Spatial Logics 2007: 713-798 - [e2]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen:
Computational Structures for Modelling Space, Time and Causality, 20.08. - 25.08.2006. Dagstuhl Seminar Proceedings 06341, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [j15]Michael B. Smyth:
The constructive maximal point space and partial metrizability. Ann. Pure Appl. Log. 137(1-3): 360-379 (2006) - [j14]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
Foreword. Theor. Comput. Sci. 365(3): 169-170 (2006) - [i3]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen:
06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality. Computational Structures for Modelling Space, Time and Causality 2006 - 2005
- [e1]Ralph Kopperman, Michael B. Smyth, Dieter Spreen, Julian Webster:
Spatial Representation: Discrete vs. Continuous Computational Models. Dagstuhl Seminar Proceedings 04351, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i2]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 - [i1]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 - 2004
- [c17]Rueiher Tsaur, Michael B. Smyth:
Convexity in Helly Graphs: Selection and Almost Fixed Point Properties for Multifunctions. MFCSIT 2004: 151-163 - 2003
- [j13]Michael B. Smyth, Rueiher Tsaur:
AFPP vs FPP. Appl. Categorical Struct. 11(1): 95-116 (2003) - 2002
- [c16]Nils Anders Danielsson, Michael B. Smyth:
Matroids from modules. MFCSIT 2002: 21-38 - [c15]Michael B. Smyth:
The constructive maximal point space. MFCSIT 2002: 172-188 - [c14]Rueiher Tsaur, Michael B. Smyth:
Fixed points in digital topology (via Helly posets). MFCSIT 2002: 207-223 - 2000
- [j12]Michael B. Smyth:
Region-based Discrete Geometry. J. Univers. Comput. Sci. 6(4): 447-459 (2000) - [c13]Rueiher Tsaur, Michael B. Smyth:
"Continuous" Multifunctions in Discrete Spaces with Applications to Fixed Point Theory. Digital and Image Geometry 2000: 75-90 - [c12]Michael B. Smyth, Rueiher Tsaur:
A Digital Version of the Kakutani Fixed Point Theorem for Convex-valued Multifunctions. MFCSIT 2000: 393-407
1990 – 1999
- 1997
- [c11]Michael B. Smyth:
Topology and tolerance. MFPS 1997: 326 - 1995
- [j11]Michael B. Smyth:
Semi-Metrics, Closure Spaces and Digital Topology. Theor. Comput. Sci. 151(1): 257-276 (1995) - 1994
- [c10]Michael B. Smyth:
Inverse Limits of Graphs. Theory and Formal Methods 1994: 397-409 - 1993
- [j10]Abbas Edalat, Michael B. Smyth:
Information categories. Appl. Categorical Struct. 1(2): 197-232 (1993) - [j9]Abbas Edalat, Michael B. Smyth:
I-Categories as a Framework for Solving Domain Equations. Theor. Comput. Sci. 115(1): 77-106 (1993) - 1992
- [c9]Abbas Edalat, Michael B. Smyth:
Compact Metric Information Systems (Extended Abstract). REX Workshop 1992: 154-173 - 1991
- [c8]Abbas Edalat, Michael B. Smyth:
Categories of Information Systems. Category Theory and Computer Science 1991: 37-52
1980 – 1989
- 1987
- [c7]Michael B. Smyth:
Quasi Uniformities: Reconciling Domains with Metric Spaces. MFPS 1987: 236-253 - 1985
- [c6]Michael B. Smyth:
Finite Approximation of Spaces. CTCS 1985: 225-241 - 1983
- [j8]Michael B. Smyth:
The Largest Cartesian Closed Category of Domains. Theor. Comput. Sci. 27: 109-119 (1983) - [c5]Michael B. Smyth:
Power Domains and Predicate Transformers: A Topological View. ICALP 1983: 662-675 - 1982
- [j7]Michael B. Smyth, Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations. SIAM J. Comput. 11(4): 761-783 (1982) - 1981
- [j6]Daniel Lehmann, Michael B. Smyth:
Algebraic Specification of Data Types: A Synthetic Approach. Math. Syst. Theory 14: 97-139 (1981) - 1980
- [c4]Michael B. Smyth:
Computability in Categories. ICALP 1980: 609-620
1970 – 1979
- 1978
- [j5]Michael B. Smyth:
Power Domains. J. Comput. Syst. Sci. 16(1): 23-36 (1978) - 1977
- [j4]Michael B. Smyth:
Effectively given Domains. Theor. Comput. Sci. 5(3): 257-274 (1977) - [c3]Daniel Lehmann, Michael B. Smyth:
Data Types (Extended Abstract). FOCS 1977: 7-12 - [c2]Michael B. Smyth, Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract). FOCS 1977: 13-17 - 1976
- [c1]Michael B. Smyth:
Powerdomains. MFCS 1976: 537-543 - 1974
- [j3]Michael B. Smyth:
Unique-Entry Graphs, Flowcharts, and State Diagrams. Inf. Control. 25(1): 20-29 (1974) - [j2]Michael B. Smyth:
Involution as a basis for propositional calculi. Notre Dame J. Formal Log. 15(4): 569-588 (1974) - 1971
- [j1]Michael B. Smyth:
A diagrammatic treatment of syllogistic. Notre Dame J. Formal Log. 12(4): 483-488 (1971)
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:03 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:
