Siefkes, D. (ed.); Braun, A. (ed.); Eulenhöfer, P. (ed.); Stach, H. (ed.); Städtler, K. (ed.) Pioneers of information science. Their biographies in interviews. (Pioniere der Informatik. Ihre Lebensgeschichte im Interview. Interviews mit F. L. Bauer, C. Floyd, J. Weizenbaum, N. Wirth und H. Zemanek. Geleitwort von Wilfried Brauer.) (German) Zbl 0914.01013 Berlin: Springer. xiii, 143 p. (1999). Reviewer: A.C.Lewis (Indianapolis) MSC: 01A70 68-03 01-02 PDF BibTeX XML Cite \textit{D. Siefkes} (ed.) et al., Pioniere der Informatik. Ihre Lebensgeschichte im Interview. Interviews mit F. L. Bauer, C. Floyd, J. Weizenbaum, N. Wirth und H. Zemanek. Geleitwort von Wilfried Brauer. Berlin: Springer (1999; Zbl 0914.01013) Full Text: DOI
Buntrock, Gerhard; Hemachandra, Lane A.; Siefkes, Dirk Using inductive counting to simulate nondeterministic computation. (English) Zbl 0769.68028 Inf. Comput. 102, No. 1, 102-117 (1993). MSC: 68Q15 PDF BibTeX XML Cite \textit{G. Buntrock} et al., Inf. Comput. 102, No. 1, 102--117 (1993; Zbl 0769.68028) Full Text: DOI
Coy, Wolfgang (ed.); Nake, Frieder (ed.); Pflüger, Jörg-Martin (ed.); Rolf, Arno (ed.); Seetzen, Jürgen (ed.); Siefkes, Dirk (ed.); Stransfeld, Reinhard (ed.) View points of computer science. (Sichtweisen der Informatik.) (German) Zbl 0812.68057 Theorie der Informatik. Wiesbaden etc.: Vieweg. VIII, 409 p. (1992). MSC: 68-06 00B15 68T01 68T99 PDF BibTeX XML Cite \textit{W. Coy} (ed.) et al., Sichtweisen der Informatik. Wiesbaden etc.: Vieweg (1992; Zbl 0812.68057)
Siefkes, Dirk Formal methods and small systems. Learning, living and working in formal environments. (Formale Methoden und kleine Systeme. Lernen, leben und arbeiten in formalen Umgebungen.) (German) Zbl 0899.68010 Theorie der Informatik. Wiesbaden: Vieweg. viii, 190 p. (1992). MSC: 68M99 68-01 PDF BibTeX XML Cite \textit{D. Siefkes}, Formale Methoden und kleine Systeme. Lernen, leben und arbeiten in formalen Umgebungen. Wiesbaden: Vieweg (1992; Zbl 0899.68010)
Hemachandra, Lane A.; Hoene, Albrecht; Siefkes, Dirk; Young, Paul On sets polynomially enumerable by iteration. (English) Zbl 0745.68047 Theor. Comput. Sci. 80, No. 2, 203-225 (1991). MSC: 68Q15 PDF BibTeX XML Cite \textit{L. A. Hemachandra} et al., Theor. Comput. Sci. 80, No. 2, 203--225 (1991; Zbl 0745.68047) Full Text: DOI
Siefkes, Dirk Formalisieren und Beweisen. Logik für Informatiker. (Formalizing and proving. Logic for computer scientists). (German) Zbl 0705.68003 Wiesbaden: Vieweg & Sohn. XIII, 259 p. DM 39.80 (1990). Reviewer: U.Schöning MSC: 68-01 68N17 68T27 68T15 PDF BibTeX XML Cite \textit{D. Siefkes}, Formalisieren und Beweisen. Logik für Informatiker. (Formalizing and proving. Logic for computer scientists). Wiesbaden: Vieweg \&| Sohn (1990; Zbl 0705.68003)
Buntrock, Gerhard; Hemachandra, Lane A.; Siefkes, Dirk Using inductive counting to simulate nondeterministic computation. (English) Zbl 0747.68015 Mathematical foundations of computer science, Proc. 15th Symp., MFCS ’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 187-194 (1990). Reviewer: G.B.Marandzhyan (Erevan) MSC: 68Q15 68Q10 PDF BibTeX XML
Büchi, J. R.; Siefkes, Dirk (ed.) Finite automata, their algebras and grammars. Towards a theory of formal expressions. (English) Zbl 0715.68062 New York etc.: Springer-Verlag. XXII, 316 p. DM 138.00 (1989). Reviewer: G.Slutzki MSC: 68Q70 68Q42 68-01 PDF BibTeX XML Cite \textit{J. R. Büchi} and \textit{D. Siefkes} (ed.), Finite automata, their algebras and grammars. Towards a theory of formal expressions. New York etc.: Springer-Verlag (1989; Zbl 0715.68062)
Hemachandra, Lane A.; Hoene, Albrecht; Siefkes, Dirk Polynomial-time functions generate SAT: On P-splinters. (English) Zbl 0755.68067 Mathematical foundations of computer science, Proc. 14th Symp., MFCS ’89, Porąbka-Kozubnik/Pol. 1989, Lect. Notes Comput. Sci. 379, 259-269 (1989). MSC: 68Q25 03D15 03D80 PDF BibTeX XML
Siefkes, D. Grammars for terms and automata. On a book by the late J. Richard Büchi. (English) Zbl 0635.68086 Computation theory and logic, D. Rödding Occas. 50th Anniv. Birth, Lect. Notes Comput. Sci. 270, 349-359 (1987). Reviewer: G.Grigoras MSC: 68Q45 68Q70 PDF BibTeX XML
Büchi, J. Richard; Mahr, Bernd; Siefkes, Dirk Recursive definition and complexity of functions over arbitrary data structures. (English) Zbl 0555.68019 Frege conference, Proc. Int. Conf., Schwerin/Ger. 1984, Math. Res. 20, 303-308 (1984). Reviewer: S.P.Yukna MSC: 68Q25 03D60 03D15 PDF BibTeX XML
Büchi, J. Richard; Siefkes, Dirk The complete extensions of the monadic second order theory of countable ordinals. (English) Zbl 0541.03003 Z. Math. Logik Grundlagen Math. 29, 289-312 (1983). Reviewer: M.Tetruashvili MSC: 03B25 03C85 PDF BibTeX XML Cite \textit{J. R. Büchi} and \textit{D. Siefkes}, Z. Math. Logik Grundlagen Math. 29, 289--312 (1983; Zbl 0541.03003) Full Text: DOI
Mahr, Bernd; Siefkes, Dirk Relating uniform and nonuniform models of computation. (English) Zbl 0484.68035 GI-11. Jahrestag., 3rd Conf. Eur. Co-op. Inf., München 1981, Inf.- Fachber. 50, 41-48 (1981). MSC: 68Q25 03D20 PDF BibTeX XML
Siefkes, Dirk An axiom system for the weak monadic second order theory of two successors. (English) Zbl 0397.03009 Isr. J. Math. 30, 264-284 (1978). MSC: 03B25 03D05 PDF BibTeX XML Cite \textit{D. Siefkes}, Isr. J. Math. 30, 264--284 (1978; Zbl 0397.03009) Full Text: DOI
Fleischmann, Klaus; Mahr, Bernd; Siefkes, Dirk Bounded concatenation theory as a uniform method for proving lower complexity bounds. (English) Zbl 0439.03004 Logic colloquium 76, Proc. Conf., Oxford 1976, Stud. Logic Found. Math., Vol. 87, 471-490 (1977). MSC: 03B25 03D15 PDF BibTeX XML
Siefkes, Dirk Degrees of circuit complexity. (English) Zbl 0368.94049 Fundam. Comput. Theory, Proc. int. Conf., Poznan-Kornik 1977, Lect. Notes Comput. Sci. 56, 522-531 (1977). MSC: 94C10 68Q25 PDF BibTeX XML
Siefkes, Dirk The recursive sets in certain monadic second order fragments of arithmetic. (English) Zbl 0325.02033 Arch. Math. Logik Grundlagenforsch. 17, 71-80 (1975). MSC: 03B25 03D05 03D25 PDF BibTeX XML Cite \textit{D. Siefkes}, Arch. Math. Logik Grundlagenforsch. 17, 71--80 (1975; Zbl 0325.02033) Full Text: DOI EuDML
Siefkes, D. (ed.) GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974. (German) Zbl 0293.00023 Lecture Notes in Computer Science. 26. Berlin-Heidelberg-New York: Springer-Verlag. IX, 748 p. DM 49.00 (1975). MSC: 00Bxx 68-06 PDF BibTeX XML
Büchi, J. Richard; Siefkes, Dirk The monadic second order theory of all countable ordinals. (English) Zbl 0298.02050 Lecture Notes in Mathematics. 328. Decidable Theories II. Berlin-Heidelberg-New York: Springer-Verlag. VI, 217 p. DM 20.00; $ 7.40 (1973). MSC: 03B25 03B15 03-02 03D05 PDF BibTeX XML Full Text: DOI
Siefkes, Dirk Büchi’s monadic second order successor arithmetic. (English) Zbl 0399.03011 Lecture Notes in Mathematics. 120. Berlin-Heidelberg-New York: Springer-Verlag. XII, 130 p. (1970). MSC: 03B25 03C35 03C10 11U05 03B15 03-02 PDF BibTeX XML Cite \textit{D. Siefkes}, Büchi's monadic second order successor arithmetic. Berlin-Heidelberg-New York: Springer-Verlag (1970; Zbl 0399.03011) Full Text: DOI
Siefkes, D. Decidable extensions of monadic second order successor arithmetic. (English) Zbl 0213.01901 Automatentheorie formale Sprachen, Tagungsbericht Math. Forschungsinst. Oberwolfach Oktober 1969, 441-472 (1970). MSC: 03F35 PDF BibTeX XML
Siefkes, D. Recursion theory and the theorem of Ramsey in one-place second order successor arithmetic. (English) Zbl 0186.01102 Contrib. Math. Logic, Proc. Logic Colloq., Hannover 1966, 237-254 (1968). PDF BibTeX XML