The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1958-1984 (15) 1986-1995 (15) 1996-2004 (15) 2005-2009 (19) 2010-2019 (17) 2020-2024 (13)
Publication types (Num. hits)
article(54) incollection(4) inproceedings(36)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 13 keywords

Results
Found 94 publication records. Showing 94 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
248Juris Hartmanis, Theodore P. Baker On Simple Goedel Numberings and Translations. Search on Bibsonomy ICALP The full citation details ... 1974 DBLP  DOI  BibTeX  RDF Goedel numberings, complexity of translations, optimal Goedel numberings, translations
177Dieter Spreen Strong reducibility of partial numberings. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Partial numberings, Total numberings, Complete numberings, Degree structure, Reducibility
154Rusins Freivalds Inductive Inference of Recursive Functions: Qualitative Theory. Search on Bibsonomy Baltic Computer Science The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
140Sanjay Jain 0001, Frank Stephan 0001 Learning in Friedberg Numberings. Search on Bibsonomy ALT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
82Sanjay Jain 0001, Frank Stephan 0001, Jason Teutsch Index Sets and Universal Numberings. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
63Paul Brodhead, Bjørn Kjos-Hanssen Numberings and Randomness. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
58Paul Brodhead, Douglas A. Cenzer Effectively closed sets and enumerations. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D30, 03D25
58Charalampos Papamanthou, Ioannis G. Tollis Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Search on Bibsonomy GD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
58Klaus Weihrauch A Generalized Computability Thesis (Abstract). Search on Bibsonomy MFCS The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
44Paul Tarau A Groupoid of Isomorphic Data Transformations. Search on Bibsonomy Calculemus/MKM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF computational mathematics in Haskell, data type transformations, ranking/unranking, Gödel numberings, higher order combinators, hylomorphisms
44Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov 0002 On a Question of Frank Stephan. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computable family of sets, TxtEX learning, equivalent numberings
44Giuseppe Longo, Eugenio Moggi Gödel Numberings, Principal Morphisms, Combinatory Algebras: A Category-theoretic Characterization of Functional Completeness. Search on Bibsonomy MFCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
25John Case, Samuel E. Moelius Characterizing Programming Systems Allowing Program Self-Reference. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computable operators, Programming systems, Recursive function theory, Recursive operators, Computability theory, Control structures, Self-reference, Recursion theorem, Numberings
25Paul Tarau An embedded declarative data transformation language. Search on Bibsonomy PPDP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF computational mathematics, dag and hypergraph encodings, functions and permutations, goedel numberings, hereditarily finite sets, pairing functions, prolog data representations, ranking/unranking bijections, digraph
25John Case, Samuel E. Moelius Program Self-reference in Constructive Scott Subdomains. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Scott domains, self-reproducing programs, self-reference, recursion theorems, numberings
24Marat Kh. Faizrahmanov On Non-principal Arithmetical Numberings and Families. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
24Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov Ideal presentations and numberings of some classes of effective quasi-Polish spaces. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Marat Kh. Faizrahmanov, Zlata Shchedrikova Effectively infinite classes of numberings and computable families of reals. Search on Bibsonomy Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Marat Kh. Faizrahmanov Numberings, c.e. oracles, and fixed points. Search on Bibsonomy Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Balthasar Grabmayr, Albert Visser Self-Reference Upfront: a Study of Self-Referential Gödel Numberings. Search on Bibsonomy Rev. Symb. Log. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev Rogers semilattices of punctual numberings. Search on Bibsonomy Math. Struct. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Marat Kh. Faizrahmanov Extremal numberings and fixed point theorems. Search on Bibsonomy Math. Log. Q. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Zhansaya Tleuliyeva Rogers semilattices of limitwise monotonic numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Henk Barendregt, Sebastiaan A. Terwijn Partial combinatory algebra and generalized numberings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Anvar M. Nurakunov On Two Types of Concept Lattices in the Theory of Numberings. Search on Bibsonomy TAMC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Balthasar Grabmayr On the invariance of Gödel's second Theorem with regard to Numberings. Search on Bibsonomy Rev. Symb. Log. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev Semilattices of Punctual Numberings. Search on Bibsonomy TAMC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
24Thomas Zeugmann On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. Search on Bibsonomy CiE The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
24Lena Schlipf, Jens M. Schmidt Simple computation of st-edge- and st-numberings from ear decompositions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Hendrik Pieter Barendregt, Sebastiaan A. Terwijn Partial combinatory algebra and generalized numberings. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
24Ian Herbert, Sanjay Jain 0001, Steffen Lempp, Manat Mustafa, Frank Stephan 0001 Reductions between types of numberings. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Henk Barendregt, Sebastiaan A. Terwijn Fixed point theorems for precomplete numberings. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Mars M. Yamaleev Elementary theories and hereditary undecidability for semilattices of numberings. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Henrique F. da Cruz, Ilda Inácio Rodrigues, Rogério Pedro Serôdio Convertible subspaces that arise from different numberings of the vertices of a graph. Search on Bibsonomy Ars Math. Contemp. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev Bounded Reducibility for Computable Numberings. Search on Bibsonomy CiE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Henk Barendregt, Sebastiaan A. Terwijn Fixed point theorems for precomplete numberings. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
24Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies From Eventually Different Functions to Pandemic Numberings. Search on Bibsonomy CiE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
24Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi Friedberg numberings in the Ershov hierarchy. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
24Kuanysh Abeshev On the existence of universal numberings for finite families of d.c.e. sets. Search on Bibsonomy Math. Log. Q. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Dieter Spreen An Isomorphism Theorem for Partial Numberings. Search on Bibsonomy Logic, Computation, Hierarchies The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Dieter Spreen Partial Numberings and Precompleteness. Search on Bibsonomy Logic, Computation, Hierarchies The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Paul Tarau Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). Search on Bibsonomy Theory Pract. Log. Program. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
24Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov Inductive inference and computable numberings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Frank Stephan 0001, Jason Teutsch Index sets and universal numberings. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Frank Stephan 0001 Numberings optimal for learning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Frank Stephan 0001 Learning in Friedberg numberings. Search on Bibsonomy Inf. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Frank Stephan 0001 Numberings Optimal for Learning. Search on Bibsonomy ALT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Serikzhan A. Badaev, Dieter Spreen A note on partial numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Wolfram Menzel, Frank Stephan 0001 Topological aspects of numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
24Serikzhan A. Badaev Computable Numberings. Search on Bibsonomy LPAR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Jochen Nessel Some Independence Results for Control Structures in Complete Numberings. Search on Bibsonomy J. Symb. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
24Dieter Spreen Representations versus numberings: on the relationship of two computability notions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
24Fred S. Annexstein, Kenneth A. Berman Directional Routing via Generalized st-Numberings. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Günter Schaar On special numberings of hypergraphs. Search on Bibsonomy Discret. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Yuri Leonidovich Ershov Theory of Numberings. Search on Bibsonomy Handbook of Computability Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Rusins Freivalds, Sanjay Jain 0001 Kolmogorov Numberings and Minimal Identification. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
24Sanjay Jain 0001, Arun Sharma 0001 Characterizing Language Identification in Terms of Computable Numberings. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
24Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. Search on Bibsonomy SIROCCO The full citation details ... 1997 DBLP  BibTeX  RDF
24Ganesh Baliga, Anil M. Shende Learning-Theoretic Perspectives of Acceptable Numberings. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
24Dieter Spreen Representations versus Numberings: On Two Computability Notions. Search on Bibsonomy DMTCS The full citation details ... 1996 DBLP  BibTeX  RDF
24Sanjay Jain 0001 An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
24Rusins Freivalds, Sanjay Jain 0001 Kolmogorov numberings and minimal identification. Search on Bibsonomy EuroCOLT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
24Joseph Cheriyan, John H. Reif Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Search on Bibsonomy Comb. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Sergei L. Bezrukov, Norbert Grünwald, Karl Weber On Edge Numberings of the n-Cube Graph. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
24Hartmut Walravens New Developments in Standard Numberings. Search on Bibsonomy Essen Symposium The full citation details ... 1993 DBLP  BibTeX  RDF
24Martin Kummer Some applications of computable one-one numberings. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. Search on Bibsonomy J. Inf. Process. Cybern. The full citation details ... 1989 DBLP  BibTeX  RDF
24Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24Kathy Williamson Hoke Completely unimodal numberings of a simple polytope. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24Martin Kummer Numberings of R1 union F. Search on Bibsonomy CSL The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24M. A. Iordanskii Minimal Numberings of the Vertices of Trees - Approximate Approach. Search on Bibsonomy FCT The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
24Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
24Gregory A. Riccardi The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions. Search on Bibsonomy Math. Log. Q. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
24Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen Inductive Inference and Computable One-One Numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
24Juris Hartmanis A Note on Natural Complete Sets and Gödel Numberings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
24Angelika Reiser, Klaus Weihrauch Natural Numberings and Generalized Computability. Search on Bibsonomy J. Inf. Process. Cybern. The full citation details ... 1980 DBLP  BibTeX  RDF
24Michael Machtey, Karl Winklmann, Paul Young Simple Gödel Numberings, Isomorphisms, and Programming Properties. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
24Jefim Kinber On btt-Degrees of Sets of Minimal Numbers in Gödel Numberings. Search on Bibsonomy Math. Log. Q. The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
24Michael Machtey, Paul Young Simple Gödel Numberings, Translations, and the P-Hierarchy Search on Bibsonomy STOC The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
24Claus-Peter Schnorr Optimal Enumerations and Optimal Gödel Numberings. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
24Juris Hartmanis, Theodore P. Baker On Simple Gödel Numberings and Translations. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
24Claus-Peter Schnorr Optimal Gödel Numberings. Search on Bibsonomy IFIP Congress (1) The full citation details ... 1971 DBLP  BibTeX  RDF
24Hartley Rogers Jr. Godel Numberings of Partial Recursive Functions. Search on Bibsonomy J. Symb. Log. The full citation details ... 1958 DBLP  DOI  BibTeX  RDF
19Riadh Khennoufa, Olivier Togni Multilevel Bandwidth and Radio Labelings of Graphs. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF generalized graph bandwidth, radio labeling, frequency assignment
19Victor L. Selivanov A Useful Undecidable Theory. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice
19Serikzhan A. Badaev On Rogers Semilattices. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
19Charalampos Papamanthou, Ioannis G. Tollis Parameterized st -Orientations of Graphs: Algorithms and Experiments. Search on Bibsonomy GD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
19L. Ya. Savel'ev An Algorithm for Partitioning a Set into Simple Parts. Search on Bibsonomy Program. Comput. Softw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Emo Welzl Geometric Optimization and Unique Sink Orientations of Cubes p. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani Fault Tolerant Algorithms for Orderings and Colorings. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Martin Kummer On the Complexity of Random Strings (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
19Joseph Cheriyan, John H. Reif Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
19Dieter Spreen Computable One-to-one Enumerations of Effective Domains. Search on Bibsonomy MFPS The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
19Alan Gibbons, Wojciech Rytter An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. Search on Bibsonomy FSTTCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #94 of 94 (100 per page; Change: )
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