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