Search the dblp DataBase
Cristian Calude :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Andris Ambainis , Kalvis Apsitis , Cristian Calude , Rusins Freivalds , Marek Karpinski , Tomas Larfeldt , Iveta Sala , Juris Smotrovs Effects of Kolmogorov Complexity Present in Inductive Inference as Well. [Citation Graph (0, 0)][DBLP ] ALT, 1997, pp:244-259 [Conf ] Joshua J. Arulanandham , Cristian Calude , Michael J. Dinneen Balance Machines: Computing = Balancing. [Citation Graph (0, 0)][DBLP ] Aspects of Molecular Computing, 2004, pp:36-48 [Conf ] Cristian Calude , Richard J. Coles Program-Size Complexity of Initial Segments and Domination Reducibility. [Citation Graph (0, 0)][DBLP ] Jewels are Forever, 1999, pp:225-237 [Conf ] Cristian Calude , Helmut Jürgensen Randomness as an Invariant for Number Representations. [Citation Graph (0, 0)][DBLP ] Results and Trends in Theoretical Computer Science, 1994, pp:44-66 [Conf ] Cristian Calude , Solomon Marcus Mathematical Proofs at a Crossroad? [Citation Graph (0, 0)][DBLP ] Theory Is Forever, 2004, pp:15-28 [Conf ] Cristian Calude Borel Normality and Algorithmic Randomness. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1993, pp:113-129 [Conf ] Cristian Calude , Elena Calude Automata: From Uncertainty to Quantum. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2001, pp:1-14 [Conf ] Cristian Calude , Elena Calude Bisimulations and behaviour of nondeterministic automata. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:60-70 [Conf ] Cristian Calude , Arto Salomaa Algorithmically Coding the Universe. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1993, pp:472-492 [Conf ] Cristian Calude , Marius Zimand Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FCT, 1995, pp:156-170 [Conf ] Cristian Calude Algorithmic Randomness, Quantum Physics, and Incompleteness. [Citation Graph (0, 0)][DBLP ] MCU, 2004, pp:1-17 [Conf ] Cristian Calude , Dragos Vaida Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:177-184 [Conf ] Cristian Calude , Peter Hertling , Bakhadyr Khoussainov , Yongge Wang Recursively Enumerable Reals and Chaitin Omega Numbers. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:596-606 [Conf ] Cristian Calude , Kai Salomaa , Sheng Yu Metric Lexical Analysis. [Citation Graph (0, 0)][DBLP ] WIA, 1999, pp:48-59 [Conf ] Cristian Calude , Elena Calude , Bakhadyr Khoussainov Deterministic Automata: Simulation, Universality and Minimality. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:90, n:1-3, pp:263-276 [Journal ] Cristian Calude , Monica Tataram Three Theories of Computational Complexity Extended Abstract. [Citation Graph (0, 0)][DBLP ] Sci. Ann. Cuza Univ., 1994, v:3, n:, pp:45-52 [Journal ] Cristian Calude , Sheng Yu Language-theoretic Complexity of Disjunctive Sequences. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:203-209 [Journal ] Joshua J. Arulanandham , Cristian Calude , Michael J. Dinneen Bead-Sort: A Natural Sorting Algorithm. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2002, v:76, n:, pp:153-161 [Journal ] Cristian Calude Note on Ehrenfeucht's conjecture and Hilbert's basis theorem. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1986, v:29, n:, pp:18-21 [Journal ] Cristian Calude , Elena Calude The Bridge Crossing Problem. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2002, v:77, n:, pp:180-190 [Journal ] Cristian Calude , Ion Chitescu A class of nuniversal P Marti-Löf tests. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1984, v:23, n:, pp:15-21 [Journal ] Cristian Calude , Elena Calude , Solomon Marcus Passages of Proof. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2004, v:84, n:, pp:167-188 [Journal ] Cristian Calude , Elena Calude , Catalina Stefanescu Computational Complementarity for Mealy Automata. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1998, v:66, n:, pp:139-149 [Journal ] Cristian Calude , Peter Hertling , Bakhadyr Khoussainov Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal ] Gregory J. Chaitin , Asat Arslanov , Cristian Calude Program-size Complexity Computes the Halting Problem. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal ] Cristian Calude , Peter Hertling Computable Approximations of Reals: An Information-Theoretic Analysis. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1998, v:33, n:2, pp:105-120 [Journal ] Cristian Calude , Gheorghe Paun Global syntax and semantics for recursively enumerable languages. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1981, v:4, n:2, pp:245-254 [Journal ] Cristian Calude , Sergiu Rudeanu Proving as a Computable Procedure. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2005, v:64, n:1-4, pp:43-52 [Journal ] Cristian Calude Preface. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:623-624 [Journal ] Cristian Calude , Hajime Ishihara , Takeshi Yamaguchi Coding with Minimal Programs. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:479-490 [Journal ] Cristian Calude Super-Exponentials Nonprimitive Recursive, but Rudimentary. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:5, pp:311-316 [Journal ] Cristian Calude , Solomon Marcus , Ludwig Staiger A topological characterization of random sequences. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:88, n:5, pp:245-250 [Journal ] Cristian Calude , Gheorghe Paun Independent Instances for Some Undecidable Problems. [Citation Graph (0, 0)][DBLP ] ITA, 1983, v:17, n:1, pp:49-54 [Journal ] Douglas S. Bridges , Cristian Calude , Michael J. Dinneen , Bakhadyr Khoussainov Logic in Computer Science. [Citation Graph (0, 0)][DBLP ] J. UCS, 1997, v:3, n:11, pp:1133- [Journal ] Cristian Calude What Is a Random String? [Citation Graph (0, 0)][DBLP ] J. UCS, 1995, v:1, n:1, pp:48-66 [Journal ] Cristian Calude The Finite, The Unbounded and The Infinite. [Citation Graph (0, 0)][DBLP ] J. UCS, 1996, v:2, n:5, pp:242-244 [Journal ] Cristian Calude Algorithmic Information Theory: Open Problems. [Citation Graph (0, 0)][DBLP ] J. UCS, 1996, v:2, n:5, pp:439-441 [Journal ] Cristian Calude , Elena Calude , Michael J. Dinneen What is the Value of Taxicab(6)? [Citation Graph (0, 0)][DBLP ] J. UCS, 2003, v:9, n:10, pp:1196-1203 [Journal ] Cristian Calude , Cristian Grozes Kraft-Chaitin Inequality Revisited. [Citation Graph (0, 0)][DBLP ] J. UCS, 1996, v:2, n:5, pp:306-310 [Journal ] Cristian Calude , Hermann A. Maurer , Arto Salomaa Journal of Universal Computer Science. [Citation Graph (0, 0)][DBLP ] J. UCS, 1994, v:0, n:0, pp:109-115 [Journal ] Cristian Calude , André Nies Chaitin Omega Numbers and Strong Reducibilities. [Citation Graph (0, 0)][DBLP ] J. UCS, 1997, v:3, n:11, pp:1162-1166 [Journal ] Cristian Calude , Gheorghe Stefanescu Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift. [Citation Graph (0, 0)][DBLP ] J. UCS, 2000, v:6, n:1, pp:1-2 [Journal ] Cristian Calude , Kai Salomaa , Sheng Yu Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue. [Citation Graph (0, 0)][DBLP ] J. UCS, 2002, v:8, n:2, pp:117-118 [Journal ] Cristian Calude , Kai Salomaa , Sheng Yu Additive Distances and Quasi-Distances Between Words. [Citation Graph (0, 0)][DBLP ] J. UCS, 2002, v:8, n:2, pp:141-152 [Journal ] Cristian Calude , Ioan Tomescu Optimum Extendible Prefix Codes. [Citation Graph (0, 0)][DBLP ] J. UCS, 1997, v:3, n:11, pp:1167-1179 [Journal ] Joshua J. Arulanandham , Cristian Calude , Michael J. Dinneen A fast natural algorithm for searching. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:320, n:1, pp:3-13 [Journal ] Douglas S. Bridges , Cristian Calude On Recursive Bounds for the Exceptional Values in Speed-Up. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:132, n:2, pp:387-394 [Journal ] Cristian Calude , Gabriel Istrate Determining and Stationary Sets for Some Classes of Partial Recursive Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:82, n:1, pp:151-155 [Journal ] Cristian Calude , Marius Zimand Effective Category and Measure in Abstract Complexity Theory. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:154, n:2, pp:307-327 [Journal ] Cristian Calude , Peter Hertling , Bakhadyr Khoussainov , Yongge Wang Recursively enumerable reals and Chaitin Omega numbers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:125-149 [Journal ] Cristian Calude A characterization of c.e. random reals. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:271, n:1-2, pp:3-14 [Journal ] Cristian Calude Chaitin Omega numbers, Solovay machines, and Gödel incompleteness. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:284, n:2, pp:269-277 [Journal ] Cristian Calude Relativized Topological Size of Sets of Partial Recursive Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:87, n:2, pp:347-352 [Journal ] Cristian Calude , Cezar Câmpeanu Note on the Topological Structure of Random Strings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:112, n:2, pp:383-390 [Journal ] Cristian Calude , Elena Calude , Bakhadyr Khoussainov Finite nondeterministic automata: Simulation and minimality. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:242, n:1-2, pp:219-235 [Journal ] Finite-State Complexity and the Size of Transducers [Citation Graph (, )][DBLP ] Search in 0.034secs, Finished in 0.037secs