Search the dblp DataBase
Michael B. Smyth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Michael B. Smyth
Power Domains. [Citation Graph (5, 0)][DBLP]
J. Comput. Syst. Sci., 1978, v:16, n:1, pp:23-36 [Journal] - Abbas Edalat, Michael B. Smyth
Categories of Information Systems. [Citation Graph (0, 0)][DBLP]
Category Theory and Computer Science, 1991, pp:37-52 [Conf] - Michael B. Smyth
Finite Approximation of Spaces. [Citation Graph (0, 0)][DBLP]
CTCS, 1985, pp:225-241 [Conf] - Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. [Citation Graph (0, 0)][DBLP]
Spatial Representation, 2005, pp:- [Conf] - Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. [Citation Graph (0, 0)][DBLP]
Spatial Representation, 2005, pp:- [Conf] - Rueiher Tsaur, Michael B. Smyth
"Continuous" Multifunctions in Discrete Spaces with Applications to Fixed Point Theory. [Citation Graph (0, 0)][DBLP]
Digital and Image Geometry, 2000, pp:75-90 [Conf] - Daniel J. Lehmann, Michael B. Smyth
Data Types (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1977, pp:7-12 [Conf] - Michael B. Smyth, Gordon D. Plotkin
The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1977, pp:13-17 [Conf] - Michael B. Smyth
Computability in Categories. [Citation Graph (0, 0)][DBLP]
ICALP, 1980, pp:609-620 [Conf] - Michael B. Smyth
Power Domains and Predicate Transformers: A Topological View. [Citation Graph (0, 0)][DBLP]
ICALP, 1983, pp:662-675 [Conf] - Michael B. Smyth
Inverse Limits of Graphs. [Citation Graph (0, 0)][DBLP]
Theory and Formal Methods, 1994, pp:397-409 [Conf] - Michael B. Smyth
Powerdomains. [Citation Graph (0, 0)][DBLP]
MFCS, 1976, pp:537-543 [Conf] - Michael B. Smyth
Quasi Uniformities: Reconciling Domains with Metric Spaces. [Citation Graph (0, 0)][DBLP]
MFPS, 1987, pp:236-253 [Conf] - Abbas Edalat, Michael B. Smyth
Compact Metric Information Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
REX Workshop, 1992, pp:154-173 [Conf] - Abbas Edalat, Michael B. Smyth
Information categories. [Citation Graph (0, 0)][DBLP]
Applied Categorical Structures, 1993, v:1, n:2, pp:197-232 [Journal] - Michael B. Smyth, Rueiher Tsaur
AFPP vs FPP. [Citation Graph (0, 0)][DBLP]
Applied Categorical Structures, 2003, v:11, n:1, pp:95-116 [Journal] - Michael B. Smyth
The constructive maximal point space and partial metrizability. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 2006, v:137, n:1-3, pp:360-379 [Journal] - Nils Anders Danielsson, Michael B. Smyth
Matroids from modules. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2002, v:74, n:, pp:- [Journal] - Michael B. Smyth
The constructive maximal point space. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2002, v:74, n:, pp:- [Journal] - Michael B. Smyth
Topology and tolerance. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1997, v:6, n:, pp:- [Journal] - Michael B. Smyth, Rueiher Tsaur
A Digital Version of the Kakutani Fixed Point Theorem for Convex-valued Multifunctions. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2000, v:40, n:, pp:- [Journal] - Rueiher Tsaur, Michael B. Smyth
Fixed points in digital topology (via Helly posets). [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2002, v:74, n:, pp:- [Journal] - Rueiher Tsaur, Michael B. Smyth
Convexity in Helly Graphs: Selection and Almost Fixed Point Properties for Multifunctions. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2006, v:161, n:, pp:151-163 [Journal] - Michael B. Smyth
Unique-Entry Graphs, Flowcharts, and State Diagrams [Citation Graph (0, 0)][DBLP]
Information and Control, 1974, v:25, n:1, pp:20-29 [Journal] - Michael B. Smyth
Region-based Discrete Geometry. [Citation Graph (0, 0)][DBLP]
J. UCS, 2000, v:6, n:4, pp:447-459 [Journal] - Daniel J. Lehmann, Michael B. Smyth
Algebraic Specification of Data Types: A Synthetic Approach. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1981, v:14, n:, pp:97-139 [Journal] - Michael B. Smyth, Gordon D. Plotkin
The Category-Theoretic Solution of Recursive Domain Equations. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1982, v:11, n:4, pp:761-783 [Journal] - Abbas Edalat, Michael B. Smyth
I-Categories as a Framework for Solving Domain Equations. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1993, v:115, n:1, pp:77-106 [Journal] - Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
Foreword. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:365, n:3, pp:169-170 [Journal] - Michael B. Smyth
Effectively given Domains. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1977, v:5, n:3, pp:257-274 [Journal] - Michael B. Smyth
The Largest Cartesian Closed Category of Domains. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1983, v:27, n:, pp:109-119 [Journal] - Michael B. Smyth
Semi-Metrics, Closure Spaces and Digital Topology. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:151, n:1, pp:257-276 [Journal]
06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality. [Citation Graph (, )][DBLP]
Topological graph dimension. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002