Hideki Tsuiki

Orcid: 0000-0003-0854-948X

Affiliations:
  • Kyoto University, Graduate School of Human and Environmental Studies, Japan


According to our database1, Hideki Tsuiki authored at least 37 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Concurrent Gaussian elimination.
CoRR, 2023

2022
Extracting total Amb programs from proofs.
Proceedings of the Programming Languages and Systems, 2022

2021
Intuitionistic fixed point logic.
Ann. Pure Appl. Log., 2021

2020
Prawf: An Interactive Proof System for Program Extraction.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
On the Complexity of Lattice Puzzles.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2017
Properties of domain representations of spaces through dyadic subbases.
Math. Struct. Comput. Sci., 2017

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).
J. Log. Anal., 2017

2016
T<sup>ω</sup>-representations of compact sets.
CoRR, 2016

2015
Preface to the special issue: Computing with infinite data: topological and logical foundations.
Math. Struct. Comput. Sci., 2015

Domain Representations Induced by Dyadic Subbases.
Log. Methods Comput. Sci., 2015

Sudoku Colorings of a 16-Cell Pre-fractal.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2013
Learning figures with the Hausdorff metric by fractals - towards computable binary classification.
Mach. Learn., 2013

A Stream Calculus of Bottomed Sequences for Real Number Computation.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Imaginary Hypercubes.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

2012
Enumerating 3D-Sudoku Solutions over Cubic Prefractal Objects.
J. Inf. Process., 2012

Imaginary Cubes and Their Puzzles.
Algorithms, 2012

2011
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).
Dagstuhl Reports, 2011

2010
Learning Figures with the Hausdorff Metric by Fractals.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Random Iteration Algorithm for Graph-Directed Sets.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Lawson topology of the space of formal balls and the hyperbolic topology.
Theor. Comput. Sci., 2008

On Finite-time Computability Preserving Conversions.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007
SUDOKU Colorings of the Hexagonal Bipyramid Fractal.
Proceedings of the Computational Geometry and Graph Theory, 2007

Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

2006
Computability and complexity in analysis.
J. Complex., 2006

2005
Real number computation with committed choice logic programming languages.
J. Log. Algebraic Methods Program., 2005

Streams with a Bottom in Functional Languages.
Proceedings of the Programming Languages and Systems, 2005

Dyadic Subbases and Representations of Topological Spaces.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

2004
Compact metric spaces as minimal-limit sets in domains of bottomed sequences.
Math. Struct. Comput. Sci., 2004

2003
A domain-theoretic semantics of lax generic functions.
Theor. Comput. Sci., 2003

2002
Real number computation through Gray code embedding.
Theor. Comput. Sci., 2002

Uniform Domains and Uniform Spaces: (Abstract).
Proceedings of the Workshop on Domains VI 2002, Birmingham, UK, September 16-19, 2002, 2002

Representations of Complete Uniform Spaces via Uniform Domains.
Proceedings of the Computability and Complexity in Analysis, 2002

2001
Programming for students of information design.
ACM SIGCSE Bull., 2001

2000
Computational Dimension of Topological Spaces.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1998
A Computationally Adequate Model for Overloading via Domain-Valued Functors.
Math. Struct. Comput. Sci., 1998

1994
A Normalizing Calculus with Overloading and Subtyping.
Proceedings of the Theoretical Aspects of Computer Software, 1994

On Typed Calculi with a Merge Operator.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994


  Loading...