The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for computability with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1937-1972 (17) 1973-1977 (17) 1978-1982 (15) 1983-1987 (23) 1988-1989 (21) 1990 (15) 1991-1993 (25) 1994-1995 (18) 1996 (35) 1997 (20) 1998 (27) 1999 (44) 2000 (52) 2001 (62) 2002 (48) 2003 (28) 2004 (57) 2005 (136) 2006 (123) 2007 (184) 2008 (142) 2009 (132) 2010 (85) 2011 (67) 2012 (124) 2013 (89) 2014 (72) 2015 (82) 2016 (85) 2017 (117) 2018 (77) 2019 (71) 2020 (82) 2021 (85) 2022 (69) 2023 (55) 2024 (6)
Publication types (Num. hits)
article(661) book(36) incollection(51) inproceedings(1597) phdthesis(31) proceedings(31)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 759 occurrences of 454 keywords

Results
Found 2407 publication records. Showing 2407 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
119Klaus Weihrauch Computability on the Probability Measures on the Borel Sets of the Unit Interval. Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
93Giorgi Japaridze Propositional computability logic I. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF interactive algorithms, linear logic, game semantics, Computability logic, computational resources
93Paresh B. Shah, James C. Pleasant Formal program verification and computability theory. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Hoare proof rules, loop programs, primitive recursive functions, computability theory, formal program verification
77Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori Some Properties of the Effective Uniform Topological Space. Search on Bibsonomy CCA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Effective uniform topological space, Computability structure, Computable function, Binary tree structure, Cylinder function, Amalgamated space of reals, Function with jump points, Partial computability
76Alexey V. Chernov, Jürgen Schmidhuber Prefix-Like Complexities and Computability in the Limit. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF limit computability, generalized Turing machine, non-halting computation, Kolmogorov complexity
76Russell Miller 0001, Dustin Mulcahey Perfect Local Computability and Computable Simulations. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF perfect local computability, simulation, computability, Category theory, local computability
71Robert I. Soare Computability and Incomputability. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Turing a-machine, Church-Turing Thesis, Kurt Gödel, Turing o-machine, computable approximations, effectively continuous functions on reals, computability in analysis, strong reducibilities reexamined, computability, Alan Turing
67Margarita V. Korovina, Oleg V. Kudinov Characteristic Properties of Majorant-Computability over the Reals. Search on Bibsonomy CSL The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
62Giorgi Japaridze Propositional computability logic II. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF interactive algorithms, linear logic, game semantics, Computability logic, computational resources
60Peter Koepke Ordinal Computability. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Ordinal machines, Infinite Time Register Machines, Constructible sets
60Xizhong Zheng A Computability Theory of Real Numbers. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
60Abbas Edalat, Ali Asghar Khanban, André Lieutier Computability in Computational Geometry. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
55James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers Computability and Complexity in Self-assembly. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computational complexity, computability, self-assembly, molecular computing
53Carl G. Jockusch Jr., Paul E. Schupp Asymptotic Density and the Theory of Computability: A Partial Survey. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
53Udi Boker, Nachum Dershowitz Honest Computability and Complexity. Search on Bibsonomy Martin Davis on Computability, Computational Logic, and Mathematical Foundations The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
53Marian Boykan Pour-El The Structure of Computability in Analysis and Physical Theory. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
53Douglas Cenzer ∏10 Classes in Computability Theory. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
53Robert I. Soare The History and Concept of Computability. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
52Hiroto Yasuura Locally Computable Coding for Unary Operations. Search on Bibsonomy Concurrency: Theory, Language, And Architecture The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
52Ker-I Ko, Klaus Weihrauch On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines
51Mathieu Hoyrup, Cristobal Rojas An Application of Martin-Löf Randomness to Effective Probability Theory. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF universal test, effective probability theory, Lebesgue integration, layerwise computability, computable analysis, Algorithmic randomness
51Keiichirou Kusakari, Masahiko Sakai Enhancing dependency pair method using strong computability in simply-typed term rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair
51Russell G. Miller Locally Computable Structures. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF extensional, perfectly locally computable, computability, locally computable, computable model theory
51Yongcheng Wu, Decheng Ding Computability of measurable sets via effective topologies. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF TTE, Measurable set, computable topological space, Measure, Computability
51Orit Hazzan Reducing abstraction level when learning computability theory concepts. Search on Bibsonomy ITiCSE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF mental processes, abstraction, computer science education, computability
51Patrick Bellot Unformly Applicative Structures, A Theory of Computability and Polyadic Functions. Search on Bibsonomy FSTTCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF polyadicity, algorithmic, abstraction, computability, representability, recursive function, definability
50Denis R. Hirschfeldt Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
50Wilfried Sieg Computability and Discrete Dynamical Systems. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
47Antje Nowack A Guarded Fragment for Abstract State Machines. Search on Bibsonomy J. Log. Lang. Inf. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Datalog LITE, guarded fixed-point logic, computability, decidability, Abstract State Machines, expressive power, guarded fragment
46José Félix Costa, Bruno Loff, Jerzy Mycka The New Promise of Analog Computation. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Xizhong Zheng, George Barmpalias On the Monotonic Computability of Semi-computable Real Numbers. Search on Bibsonomy DMTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Hiroyasu Kamo Effective Contraction Theorem and Its Application. Search on Bibsonomy CCA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
46Yehoshua Sagiv On Testing Effective Computability of Magic Programs. Search on Bibsonomy DOOD The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
46Ravi Krishnamurthy, Raghu Ramakrishnan 0001, Oded Shmueli A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). Search on Bibsonomy SIGMOD Conference The full citation details ... 1988 DBLP  DOI  BibTeX  RDF DATALOG
46Joel David Hamkins, Russell G. Miller Post's Problem for Ordinal Register Machines. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF ordinal computability, ordinal register machine, Post’s Problem, computability
46John Havlicek Computable Obstructions to Wait-free Computability. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF computable obstructions, distributed decision task, wait-free protocol, fault-tolerant computation, computability, asynchronous distributed systems, shared-memory model, wait-free computability
45Martín Hötzel Escardó Computability of Continuous Solutions of Higher-Type Equations. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Higher-type computability, Kleene-Kreisel spaces of continuous functionals, exhaustible set
45Hajime Ishihara Unique Existence and Computability in Constructive Reverse Mathematics. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF unique existence, Brouwer’s fan theorem, weak König lemma, computability, constructive mathematics, reverse mathematics
45Jirí Wiedermann, Lukás Petru Computability in Amorphous Structures. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF simulation, complexity, computability, universality, amorphous computers
43Henry Yuen Einstein Meets Turing: The Computability of Nonlocal Games. Search on Bibsonomy CiE The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
43Daniel Silva Graça, Ning Zhong 0002 Computability of Limit Sets for Two-Dimensional Flows. Search on Bibsonomy CiE The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
43Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov Degrees of Non-computability of Homeomorphism Types of Polish Spaces. Search on Bibsonomy CiE The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
43Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001 On Computability of Navier-Stokes' Equation. Search on Bibsonomy CiE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
43Peter Hertling Computable Real Functions: Type 1 Computability Versus Type 2 Computability. Search on Bibsonomy CCA The full citation details ... 1996 DBLP  BibTeX  RDF
42Kohtaro Tadaki Fixed Point Theorems on Partial Randomness. Search on Bibsonomy LFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF partial randomness, Chaitin’s ? number, algorithmic information theory, thermodynamic quantities, fixed point theorem, Algorithmic randomness
42Joel David Hamkins A Survey of Infinite Time Turing Machines. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Gunter Grieser, Klaus P. Jantke, Steffen Lange Towards the Validation of Inductive Learning Systems. Search on Bibsonomy ALT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
42Vasco Brattka, Klaus Weihrauch, Xizhong Zheng Approaches to Effective Semi-continuity of Real Functions. Search on Bibsonomy COCOON The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
42Marian Boykan Pour-El Computer Science And Recursion Theory. Search on Bibsonomy ACM Annual Conference (1) The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
42Wesley Calvert, Russell G. Miller Real Computable Manifolds and Homotopy Groups. Search on Bibsonomy UC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Blum-Shub-Smale computability, Computability, homotopy, manifold
41John Case Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computability theoretic learning, Fair polynomial time, Memory limitations, Optimality
41Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller Spectra of Algebraic Fields and Subfields. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computability, algebraic, field, spectrum, computable model theory
41Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel S01 and P01 Equivalence Structures. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF equivalence structures, effective categoricity, computability theory, computable model theory
41John Case, Samuel E. Moelius Characterizing Programming Systems Allowing Program Self-reference. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Computability Theory, Programming Language Semantics, Self-Reference
41Joel David Hamkins, David Linetsky, Russell G. Miller The Complexity of Quickly ORM-Decidable Sets. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF ordinal computation, infinite time computation, hyperarithmetical hierarchy, complexity, computability, Ordinal, arithmetical hierarchy, register machine
41Anton Setzer Partial Recursive Functions in Martin-Löf Type Theory. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Martin-Löf type theory, Kleene index, Kleene brackets, partial recursive functions, inductive-recursive definitions, indexed induction-recursion, computability theory, recursion theory
41Fredrik Dahlgren Partial Continuous Functions and Admissible Domain Representations. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF domain representations, computability theory, computable analysis, Domain theory
41Tie Hou Coinductive Proofs for Basic Real Computation. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Real computation, Coinductive proof, Signed digit streams, Minlog, Computability
41Jérôme Durand-Lose Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 2-counter automata, Reversibility, Conservativeness, Turing-computability, Rational numbers, Abstract geometrical computation
41Paul Brodhead, Douglas Cenzer, Seyyed Dashti Random Closed Sets. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF ?01 Classes, Computability, Randomness
41Douglas Cenzer, Zia Uddin Logspace Complexity of Functions and Structures. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Complexity, Computability, Computable Model Theory
41Robert McNaughton Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. Search on Bibsonomy Commun. ACM The full citation details ... 1968 DBLP  DOI  BibTeX  RDF Ph.D computer science curriculum, Ph.D computer science program, automata, formal languages, theory of computability, switching theory
39Tobias Gärtner, Günter Hotz Computability of Analytic Functions with Analytic Machines. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
39Guido Gherardi Internal Computability. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Nonstandard Analysis, Type-2 Theory of Effectivity, Theory of Representations, Computable Analysis, Constructive Mathematics
39John Case Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Richard Zach Kurt Gödel and Computability Theory. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Arnon Avron From Constructibility and Absoluteness to Computability and Domain Independence. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Martin Ziegler 0001 Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
39Margarita V. Korovina, Oleg V. Kudinov Towards Computability of Higher Type Continuous Data. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
39Margarita V. Korovina, Oleg V. Kudinov Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. Search on Bibsonomy CCA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond (eds.) Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Eric Allender The Complexity of Complexity. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Rumen D. Dimitrov, Valentina S. Harizanov The Lattice of Computably Enumerable Vector Spaces. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Carl G. Jockusch Jr. Herrmann's Beautiful Theorem on Computable Partial Orderings. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39George Barmpalias, Andrew Lewis-Pye A Note on the Differences of Computably Enumerable Reals. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick Effectiveness of Hindman's Theorem for Bounded Sums. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Johanna N. Y. Franklin Strength and Weakness in Computable Structure Theory. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Nikolay K. Vereshchagin, Alexander Shen Algorithmic Statistics: Forty Years Later. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Bjørn Kjos-Hanssen A Rigid Cone in the Truth-Table Degrees with Jump. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Rupert Hölzl 0001, Dilip Raghavan, Frank Stephan 0001, Jing Zhang Weakly Represented Families in Reverse Mathematics. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Antonio Montalbán Effectively Existentially-Atomic Structures. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Marat M. Arslanov, Iskander Sh. Kalimullin A Survey of Results on the d-c.e. and n-c.e. Degrees. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Vasco Brattka, Guido Gherardi, Rupert Hölzl 0001, Arno Pauly The Vitali Covering Theorem in the Weihrauch Lattice. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Joseph S. Miller On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi A Survey on Universal Computably Enumerable Equivalence Relations. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek Introduction to Autoreducibility and Mitoticity. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Guohua Wu, Mars M. Yamaleev There Are No Maximal d.c.e. wtt-degrees. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Lance Fortnow Complexity with Rod. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Leo Harrington, Richard A. Shore, Theodore A. Slaman Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Stephen G. Simpson Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Alexandra A. Soskova, Mariya Ivanova Soskova Enumeration Reducibility and Computable Structure Theory. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen Effective Bi-immunity and Randomness. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Klaus Ambos-Spies On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Denis R. Hirschfeldt Some Questions in Computable Mathematics. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Anil Nerode Prequel to the Cornell Computer Science Department. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Robert Goldblatt Cameo of a Consummate Computabilist. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Andrey S. Morozov Computable Model Theory over the Reals. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Peter A. Cholak On Splits of Computably Enumerable Sets. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Liang Yu, Yizheng Zhu On the Reals Which Cannot Be Random. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev Nondensity of Double Bubbles in the D.C.E. Degrees. Search on Bibsonomy Computability and Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2407 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license