| 2010 | ||
|---|---|---|
| 38 | Michael B. Smyth, Rueiher Tsaur, Iain Stewart: Topological graph dimension. Discrete Mathematics 310(2): 325-329 (2010) | |
| 2008 | ||
| 37 | Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen: Foreword. Theor. Comput. Sci. 405(1-2): 1-2 (2008) | |
| 2007 | ||
| 36 | Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen: Computational Structures for Modelling Space, Time and Causality, 20.08. - 25.08.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 | |
| 35 | Michael B. Smyth, Julian Webster: Discrete Spatial Models. Handbook of Spatial Logics 2007: 713-798 | |
| 2006 | ||
| 34 | 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 | |
| 33 | Michael B. Smyth: The constructive maximal point space and partial metrizability. Ann. Pure Appl. Logic 137(1-3): 360-379 (2006) | |
| 32 | 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) | |
| 31 | Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: Foreword. Theor. Comput. Sci. 365(3): 169-170 (2006) | |
| 2005 | ||
| 30 | Ralph Kopperman, Michael B. Smyth, Dieter Spreen, Julian Webster: Spatial Representation: Discrete vs. Continuous Computational Models IBFI, Schloss Dagstuhl, Germany 2005 | |
| 29 | Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: 04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 | |
| 28 | Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster: 04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 | |
| 2003 | ||
| 27 | Michael B. Smyth, Rueiher Tsaur: AFPP vs FPP. Applied Categorical Structures 11(1): 95-116 (2003) | |
| 2002 | ||
| 26 | Michael B. Smyth: The constructive maximal point space. Electr. Notes Theor. Comput. Sci. 74: 172-188 (2002) | |
| 25 | Rueiher Tsaur, Michael B. Smyth: Fixed points in digital topology (via Helly posets). Electr. Notes Theor. Comput. Sci. 74: 207-223 (2002) | |
| 24 | Nils Anders Danielsson, Michael B. Smyth: Matroids from modules. Electr. Notes Theor. Comput. Sci. 74: 21-38 (2002) | |
| 2000 | ||
| 23 | Rueiher Tsaur, Michael B. Smyth: "Continuous" Multifunctions in Discrete Spaces with Applications to Fixed Point Theory. Digital and Image Geometry 2000: 75-90 | |
| 22 | 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) | |
| 21 | Michael B. Smyth: Region-based Discrete Geometry. J. UCS 6(4): 447-459 (2000) | |
| 1997 | ||
| 20 | Michael B. Smyth: Topology and tolerance. Electr. Notes Theor. Comput. Sci. 6: 326 (1997) | |
| 1995 | ||
| 19 | Michael B. Smyth: Semi-Metrics, Closure Spaces and Digital Topology. Theor. Comput. Sci. 151(1): 257-276 (1995) | |
| 1994 | ||
| 18 | Michael B. Smyth: Inverse Limits of Graphs. Theory and Formal Methods 1994: 397-409 | |
| 1993 | ||
| 17 | Abbas Edalat, Michael B. Smyth: Information categories. Applied Categorical Structures 1(2): 197-232 (1993) | |
| 16 | Abbas Edalat, Michael B. Smyth: I-Categories as a Framework for Solving Domain Equations. Theor. Comput. Sci. 115(1): 77-106 (1993) | |
| 1992 | ||
| 15 | Abbas Edalat, Michael B. Smyth: Compact Metric Information Systems (Extended Abstract). REX Workshop 1992: 154-173 | |
| 1991 | ||
| 14 | Abbas Edalat, Michael B. Smyth: Categories of Information Systems. Category Theory and Computer Science 1991: 37-52 | |
| 1987 | ||
| 13 | Michael B. Smyth: Quasi Uniformities: Reconciling Domains with Metric Spaces. MFPS 1987: 236-253 | |
| 1985 | ||
| 12 | Michael B. Smyth: Finite Approximation of Spaces. CTCS 1985: 225-241 | |
| 1983 | ||
| 11 | Michael B. Smyth: Power Domains and Predicate Transformers: A Topological View. ICALP 1983: 662-675 | |
| 10 | Michael B. Smyth: The Largest Cartesian Closed Category of Domains. Theor. Comput. Sci. 27: 109-119 (1983) | |
| 1982 | ||
| 9 | Michael B. Smyth, Gordon D. Plotkin: The Category-Theoretic Solution of Recursive Domain Equations. SIAM J. Comput. 11(4): 761-783 (1982) | |
| 1981 | ||
| 8 | Daniel J. Lehmann, Michael B. Smyth: Algebraic Specification of Data Types: A Synthetic Approach. Mathematical Systems Theory 14: 97-139 (1981) | |
| 1980 | ||
| 7 | Michael B. Smyth: Computability in Categories. ICALP 1980: 609-620 | |
| 1978 | ||
| 6 | Michael B. Smyth: Power Domains. J. Comput. Syst. Sci. 16(1): 23-36 (1978) | |
| 1977 | ||
| 5 | Michael B. Smyth, Gordon D. Plotkin: The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) FOCS 1977: 13-17 | |
| 4 | Daniel J. Lehmann, Michael B. Smyth: Data Types (Extended Abstract) FOCS 1977: 7-12 | |
| 3 | Michael B. Smyth: Effectively given Domains. Theor. Comput. Sci. 5(3): 257-274 (1977) | |
| 1976 | ||
| 2 | Michael B. Smyth: Powerdomains. MFCS 1976: 537-543 | |
| 1974 | ||
| 1 | Michael B. Smyth: Unique-Entry Graphs, Flowcharts, and State Diagrams Information and Control 25(1): 20-29 (1974) | |
| 1 | Nils Anders Danielsson | [24] |
| 2 | Abbas Edalat | [14] [15] [16] [17] |
| 3 | Ralph Kopperman | [28] [29] [30] [31] [34] [36] [37] |
| 4 | Daniel J. Lehmann | [4] [8] |
| 5 | Prakash Panangaden | [28] [29] [31] [34] [36] [37] |
| 6 | Gordon D. Plotkin | [5] [9] |
| 7 | Dieter Spreen | [28] [29] [30] [31] [34] [36] [37] |
| 8 | Iain Stewart | [38] |
| 9 | Rueiher Tsaur | [22] [23] [25] [27] [32] [38] |
| 10 | Julian Webster | [28] [29] [30] [31] [35] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page