Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael B. Smyth
2010 – today
- 2010
[j21]Michael B. Smyth, Rueiher Tsaur, Iain Stewart: Topological graph dimension. Discrete Mathematics 310(2): 325-329 (2010)
2000 – 2009
- 2008
- [j20]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen: Foreword. Theor. Comput. Sci. 405(1-2): 1-2 (2008)
- 2007
- [p1]
- [e2]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen (Eds.): 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
- 2006
- [j19]Michael B. Smyth: The constructive maximal point space and partial metrizability. Ann. Pure Appl. Logic 137(1-3): 360-379 (2006)
- [j18]Rueiher Tsaur, Michael B. Smyth: Convexity in Helly Graphs: Selection and Almost Fixed Point Properties for Multifunctions. Electr. Notes Theor. Comput. Sci. 161: 151-163 (2006)
- [j17]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: Foreword. Theor. Comput. Sci. 365(3): 169-170 (2006)
- [c14]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
- [c13]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: 04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005
- [c12]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: 04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005
- [e1]Ralph Kopperman, Michael B. Smyth, Dieter Spreen, Julian Webster (Eds.): Spatial Representation: Discrete vs. Continuous Computational Models. Dagstuhl Seminar Proceedings 04351, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
- 2003
- [j16]
- 2002
- [j15]Nils Anders Danielsson, Michael B. Smyth: Matroids from modules. Electr. Notes Theor. Comput. Sci. 74: 21-38 (2002)
- [j14]Michael B. Smyth: The constructive maximal point space. Electr. Notes Theor. Comput. Sci. 74: 172-188 (2002)
- [j13]Rueiher Tsaur, Michael B. Smyth: Fixed points in digital topology (via Helly posets). Electr. Notes Theor. Comput. Sci. 74: 207-223 (2002)
- 2000
- [j12]Michael B. Smyth, Rueiher Tsaur: A Digital Version of the Kakutani Fixed Point Theorem for Convex-valued Multifunctions. Electr. Notes Theor. Comput. Sci. 40: 393-407 (2000)
- [j11]
- [c11]Rueiher Tsaur, Michael B. Smyth: "Continuous" Multifunctions in Discrete Spaces with Applications to Fixed Point Theory. Digital and Image Geometry 2000: 75-90
1990 – 1999
- 1997
- [j10]
- 1995
- [j9]Michael B. Smyth: Semi-Metrics, Closure Spaces and Digital Topology. Theor. Comput. Sci. 151(1): 257-276 (1995)
- 1994
- [c10]
- 1993
- [j8]Abbas Edalat, Michael B. Smyth: Information categories. Applied Categorical Structures 1(2): 197-232 (1993)
- [j7]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]
- 1985
- [c6]
- 1983
- [j6]Michael B. Smyth: The Largest Cartesian Closed Category of Domains. Theor. Comput. Sci. 27: 109-119 (1983)
- [c5]
- 1982
- [j5]Michael B. Smyth, Gordon D. Plotkin: The Category-Theoretic Solution of Recursive Domain Equations. SIAM J. Comput. 11(4): 761-783 (1982)
- 1981
- [j4]Daniel J. Lehmann, Michael B. Smyth: Algebraic Specification of Data Types: A Synthetic Approach. Mathematical Systems Theory 14: 97-139 (1981)
- 1980
- [c4]
1970 – 1979
- 1978
- [j3]
- 1977
- [j2]
- [c3]
- [c2]Michael B. Smyth, Gordon D. Plotkin: The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract). FOCS 1977: 13-17
- 1976
- [c1]
- 1974
- [j1]Michael B. Smyth: Unique-Entry Graphs, Flowcharts, and State Diagrams. Information and Control 25(1): 20-29 (1974)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:12 CEST by the dblp team