Douglas Cenzer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2023

Generically Computable Abelian GroupsWesley Calvert, Douglas Cenzer, Valentina S. Harizanov. uc 2023: 32-45 [doi]

Extraction Rates of Random Continuous FunctionalsDouglas Cenzer, Cameron Fraize, Christopher P. Porter. uc 2023: 46-63 [doi]

Randomness extraction in computability theoryDouglas Cenzer, Christopher P. Porter. computability, 12(1):1-21, 2023. [doi]

2022

Densely computable structuresWesley Calvert, Douglas Cenzer, Valentina S. Harizanov. logcom, 32(3):581-607, 2022. [doi]

Generically and coarsely computable isomorphismsWesley Calvert, Douglas Cenzer, Valentina S. Harizanov. computability, 11(3-4):223-239, 2022. [doi]

The Isomorphism Problem for FST Injection StructuresDouglas Cenzer, Richard Krogman. lfcs 2022: 25-36 [doi]

Complexity of injection structures induced by finite state transducersRichard Krogman, Douglas Cenzer. logcom, 32(8):1504-1530, 2022. [doi]

2021

Complexity and Categoricity of Injection Structures Induced by Finite State TransducersRichard Krogman, Douglas Cenzer. CiE 2021: 106-119 [doi]

2020

Effective Categoricity of Automatic Equivalence and Nested Equivalence StructuresJacob Carson, Douglas Cenzer, Jeffrey B. Remmel. mst, 64(6):1110-1139, 2020. [doi]

On the complexity of index sets for finite predicate logic programs which allow function symbolsDouglas Cenzer, Victor W. Marek, Jeffrey B. Remmel. logcom, 30(1):107-156, 2020. [doi]

2018

0 ClassDouglas Cenzer, Christopher P. Porter. mst, 62(7):1637-1671, 2018. [doi]

Online Computability and Differentiation in the Cantor SpaceDouglas Cenzer, Diego A. Rojas. CiE 2018: 136-145 [doi]

2017

2015

Algorithmically Random Functions and Effective CapacitiesDouglas Cenzer, Christopher P. Porter. tamc 2015: 23-37 [doi]

2014

Computability and Categoricity of Ultrahomogeneous StructuresFrancis Adams, Douglas Cenzer. CiE 2014: 1-10 [doi]

2013

Sub-computable Bounded PseudorandomnessDouglas Cenzer, Jeffrey B. Remmel. lfcs 2013: 104-118 [doi]

Effective Randomness of Unions and IntersectionsDouglas Cenzer, Rebecca Weber. mst, 52(1):48-64, 2013. [doi]

Two-to-one structuresDouglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel. logcom, 23(6):1195-1223, 2013. [doi]

2012

Computability of Countable Subshifts in One DimensionDouglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman. mst, 51(3):352-371, 2012. [doi]

A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programsDouglas Cenzer, Jeffrey B. Remmel. AMAI, 65(1):1-24, 2012. [doi]

2011

Σ:::0:::::1:: and Π:::0:::::1:: equivalence structuresDouglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel. APAL, 162(7):490-503, 2011. [doi]

Effective Categoricity of Injection StructuresDouglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel. CiE 2011: 51-60 [doi]

A superhigh diamond in the c.e. ::::tt::::-degreesDouglas Cenzer, Johanna N. Y. Franklin, Jiang Liu 0002, Guohua Wu. AML, 50(1-2):33-44, 2011. [doi]

2009

2008

Effective Symbolic DynamicsDouglas Cenzer, S. Ali Dashti, Jonathan L. F. King. ENTCS, 202:89-99, 2008. [doi]

Computable symbolic dynamicsDouglas Cenzer, S. Ali Dashti, Jonathan L. F. King. mlq, 54(5):460-469, 2008. [doi]

A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic ProgramsDouglas Cenzer, Jeffrey B. Remmel. isaim 2008: [doi]

2007

Algorithmic Randomness of Closed SetsGeorge Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber. logcom, 17(6):1041-1062, 2007. [doi]

Random Continuous FunctionsPaul Brodhead, Douglas Cenzer, Jeffrey B. Remmel. ENTCS, 167:275-287, 2007. [doi]

PrefaceDouglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch. ENTCS, 167:1-2, 2007. [doi]

Medvedev Degrees of Generalized R.E. separating ClassesDouglas Cenzer, Peter G. Hinman. ENTCS, 167:203-223, 2007. [doi]

2006

Random Closed SetsPaul Brodhead, Douglas Cenzer, Seyyed Dashti. cie 2006: 55-64 [doi]

Effective categoricity of equivalence structuresWesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov. APAL, 141(1-2):61-78, 2006. [doi]

Logspace Complexity of Functions and StructuresDouglas Cenzer, Zia Uddin. cie 2006: 75-84 [doi]

2005

Minimal extensions of Pi:::0:::::1:: classesDouglas Cenzer, Farzan Riazati. mlq, 51(2):206-216, 2005. [doi]

2004

Index sets for computable differential equationsDouglas Cenzer, Jeffrey B. Remmel. mlq, 50(4-5):329-344, 2004. [doi]

Using Logic Programs to Reason about Infinite SetsDouglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel. isaim 2004: [doi]

2002

Common Derivations in Locally Determined Logic ProgramsDouglas Cenzer, Amy Vanderbilt. isaim 2004: [doi]

1999

∏10 Classes in Computability TheoryDouglas Cenzer. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 37-85, North-Holland, 1999. [doi]

1978

On vertex k-partitions of certain infinite graphsDouglas Cenzer, Edward Howorka. DM, 23(2):105-113, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL