default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd DMTCS 2001: Constanta, Romania
- Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan:
Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania. Discrete mathematics and theoretical computer science, Springer 2001, ISBN 978-1-85233-526-7 - Frank Harary:
Early Computer Science Adventures of a Mathematician. 1-4 - Hajime Ishihara:
Sequentially Continuity in Constructive Mathematics. 5-12 - Piergiorgio Odifreddi:
Recursive Functions: An Archeological Look. 13-31 - Ioan Tomescu:
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity. 33-46 - Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula:
Some Results for Some Conjectures in Addition Chains. 47-54 - Verónica Becher
, Sergio Daicz, Gregory J. Chaitin:
A Highly Random Number. 55-68 - Douglas S. Bridges:
Dini's Theorem: A Constructive Case Study. 69-80 - Henning Fernau:
Even Linear Simple Matrix Languages: Formal Language Aspects. 81-96 - George Georgescu, Afrodita Iorgulescu:
Pseudo-BCK Algebras: An Extension of BCK Algebras. 97-114 - Lane A. Hemaspaandra, Harald Hempel:
P-Immune Sets with Holes Lack Self-Reducibility Properties. 115-124 - Daniel Hort, Jirí Rachunek:
Lex Ideals of Generalized MV-Algebras. 125-136 - Jouni Järvinen:
Armstrong Systems on Ordered Sets. 137-149 - Vadim E. Levit, Eugen Mandrescu:
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings. 151-157 - Martin Plátek, Tomás Holan, Vladislav Kubon:
On Relax-ability of Word-Order by D-grammars. 159-173 - Adriana Popovici, Dan Popovici:
On the Structure of Linear Cellular Automata. 175-185 - Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Monotonically Computable Real Numbers. 187-201 - Peter Schuster, Luminita Vîta, Douglas S. Bridges:
Apartness as a Relation Between Subsets. 203-214 - Ludwig Staiger:
How Large is the Set of Disjunctive Sequences? 215-225 - Vincent Vajnovszki:
A Loopless Generation of Bitstrings without p Consecutive Ones. 227-240 - Vitaly I. Voloshin:
Greedy Algorithms for the Lower and Upper Chromatic Numbers. 241-251
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.
last updated on 2025-04-01 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
