Result 1 to 20 of 33 total
Independent subbases and non-redundant codings of separable metrizable spaces. (English)
Topology Appl. 158, No. 1, 1-14 (2011).
1
Learning figures with the Hausdorff metric by fractals. (English)
Hutter, Marcus (ed.) et al., Algorithmic learning theory. 21st international conference, ALT 2010, Canberra, Australia, October 6‒8, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16107-0/pbk). Lecture Notes in Computer Science 6331. Lecture Notes in Artificial Intelligence, 315-329 (2010).
2
Learning figures with the Hausdorff metric by fractals (English)
ALT, 315-329 (2010).
3
Random iteration algorithm for graph-directed sets. (English)
Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18‒22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs ‒ OpenAccess Series in Informatics 11, 12 p., electronic only (2009).
4
Fine-continuous functions and fractals defined by infinite systems of contractions. (English)
Archibald, Margaret (ed.) et al., Infinity in logic and computation. International conference, ILC 2007, Cape Town, South Africa, November 3‒5, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-03091-8/pbk). Lecture Notes in Computer Science 5489. Lecture Notes in Artificial Intelligence, 109-125 (2009).
5
On finite-time computability preserving conversions. (English)
J. UCS 15, No. 6, 1365-1380, electronic only (2009).
6
Random iteration algorithm for graph-directed sets (English)
CCA (2009).
7
On finite-time computability preserving conversions. (English)
Electron. Notes Theor. Comput. Sci. 221, 299-308 (2008).
8
SUDOKU colorings of the hexagonal bipyramid fractal. (English)
Ito, Hiro (ed.) et al., Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11‒15, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). Lecture Notes in Computer Science 4535, 224-235 (2008).
9
Lawson topology of the space of formal balls and the hyperbolic topology. (English)
Theor. Comput. Sci. 405, No. 1-2, 198-205 (2008).
10
Fine-continuous functions and fractals defined by infinite systems of contractions (English)
ILC, 109-125 (2007).
11
Sudoku colorings of the hexagonal bipyramid fractal (English)
KyotoCGGT, 224-235 (2007).
12
Streams with a bottom in functional languages. (English)
Sagiv, Mooly (ed.), Programming languages and systems. 14th European symposium on programming, ESOP 2005, held as part of the joint European conferences on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4‒8, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25435-8/pbk). Lecture Notes in Computer Science 3444, 201-216 (2005).
13
Real number computation with committed choice logic programming languages. (English)
J. Log. Algebr. Program. 64, No. 1, 61-84 (2005).
14
Dyadic subbases and representations of topological spaces (English)
Spatial Representation (2005).
15
Streams with a bottom in functional languages (English)
ESOP, 201-216 (2005).
16
CCA 2005 - second international conference on computability and complexity in analysis, August 25-29, 2005, Kyoto, Japan (English)
Informatik Berichte: CCA 2005, Article No. 2005 (2005).
17
Uniform domains and uniform spaces: (Abstract). (English)
Electron. Notes Theor. Comput. Sci. 73, 213-215 (2004).
18
Compact metric spaces as minimal-limit sets in domains of bottomed sequences. (English)
Math. Struct. Comput. Sci. 14, No. 6, 853-878 (2004).
19
A domain-theoretic semantics of lax generic functions. (English)
Theor. Comput. Sci. 294, No. 1-2, 307-331 (2003).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
