Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Cristian S. Calude

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Douglas S. Bridges

> Home > Persons > Cristian S. Calude

Publications

1997
[j29]
- view
  - electronic edition @ jucs.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/jucs/BridgesCDK97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jucs/BridgesCDK97
Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov:
Logic in Computer Science. J. Univers. Comput. Sci. 3(11): 1133 (1997)
1996
[e1]
- view
- export record
  dblp key:
  - conf/dmtcs/1996
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dmtcs/1996
Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, Ian H. Witten:
First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996. Springer-Verlag, Singapore 1996, ISBN 981-3083-14-X [contents]
1994
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BridgesC94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BridgesC94
Douglas S. Bridges, Cristian Calude:
On Recursive Bounds for the Exceptional Values in Speed-Up. Theor. Comput. Sci. 132(2): 387-394 (1994)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.