Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
248 | Juris Hartmanis, Theodore P. Baker |
On Simple Goedel Numberings and Translations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings, pp. 301-316, 1974, Springer, 3-540-06841-4. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
Goedel numberings, complexity of translations, optimal Goedel numberings, translations |
177 | Dieter Spreen |
Strong reducibility of partial numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(2), pp. 209-217, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Partial numberings, Total numberings, Complete numberings, Degree structure, Reducibility |
154 | Rusins Freivalds |
Inductive Inference of Recursive Functions: Qualitative Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Baltic Computer Science ![In: Baltic Computer Science, Selected Papers, pp. 77-110, 1991, Springer, 3-540-54131-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
140 | Sanjay Jain 0001, Frank Stephan 0001 |
Learning in Friedberg Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 79-93, 2007, Springer, 978-3-540-75224-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
82 | Sanjay Jain 0001, Frank Stephan 0001, Jason Teutsch |
Index Sets and Universal Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 270-279, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
63 | Paul Brodhead, Bjørn Kjos-Hanssen |
Numberings and Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 49-58, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Paul Brodhead, Douglas A. Cenzer |
Effectively closed sets and enumerations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(7-8), pp. 565-582, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 355-367, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Klaus Weihrauch |
A Generalized Computability Thesis (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings, pp. 570, 1977, Springer, 0-387-08353-7. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
44 | Paul Tarau |
A Groupoid of Isomorphic Data Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Calculemus/MKM ![In: Intelligent Computer Mathematics, 16th Symposium, Calculemus 2009, 8th International Conference, MKM 2009, Held as Part of CICM 2009, Grand Bend, Canada, July 6-12, 2009. Proceedings, pp. 170-185, 2009, Springer, 978-3-642-02613-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 423-432, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings, pp. 397-406, 1984, Springer, 3-540-13372-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
25 | John Case, Samuel E. Moelius |
Characterizing Programming Systems Allowing Program Self-Reference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 756-772, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, September 7-9, 2009, Coimbra, Portugal, pp. 171-182, 2009, ACM, 978-1-60558-568-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 89-98, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 68(2), pp. 271-282, April 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.08469, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Marat Kh. Faizrahmanov, Zlata Shchedrikova |
Effectively infinite classes of numberings and computable families of reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 12(4), pp. 339-350, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Marat Kh. Faizrahmanov |
Numberings, c.e. oracles, and fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 12(3), pp. 271-282, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Balthasar Grabmayr, Albert Visser |
Self-Reference Upfront: a Study of Self-Referential Gödel Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 16(2), pp. 385-424, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev |
Rogers semilattices of punctual numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 32(2), pp. 164-188, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Marat Kh. Faizrahmanov |
Extremal numberings and fixed point theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 68(4), pp. 398-408, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Nikolay Bazhenov 0001, Manat Mustafa, Zhansaya Tleuliyeva |
Rogers semilattices of limitwise monotonic numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 68(2), pp. 213-226, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Henk Barendregt, Sebastiaan A. Terwijn |
Partial combinatory algebra and generalized numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 925, pp. 37-44, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 17th Annual Conference, TAMC 2022, Tianjin, China, September 16-18, 2022, Proceedings, pp. 79-92, 2022, Springer, 978-3-031-20349-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Balthasar Grabmayr |
On the invariance of Gödel's second Theorem with regard to Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 14(1), pp. 51-84, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev |
Semilattices of Punctual Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings., pp. 1-12, 2020, Springer, 978-3-030-59266-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Zeugmann |
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings, pp. 124-136, 2020, Springer, 978-3-030-51465-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Lena Schlipf, Jens M. Schmidt |
Simple computation of st-edge- and st-numberings from ear decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 145, pp. 58-63, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Hendrik Pieter Barendregt, Sebastiaan A. Terwijn |
Partial combinatory algebra and generalized numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.07750, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | Ian Herbert, Sanjay Jain 0001, Steffen Lempp, Manat Mustafa, Frank Stephan 0001 |
Reductions between types of numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 170(12), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Henk Barendregt, Sebastiaan A. Terwijn |
Fixed point theorems for precomplete numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 170(10), pp. 1151-1161, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Nikolay Bazhenov 0001, Manat Mustafa, Mars M. Yamaleev |
Elementary theories and hereditary undecidability for semilattices of numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 58(3-4), pp. 485-500, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 16(2), pp. 473-486, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Nikolay Bazhenov 0001, Manat Mustafa, Sergei Ospichev |
Bounded Reducibility for Computable Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings, pp. 96-107, 2019, Springer, 978-3-030-22995-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Henk Barendregt, Sebastiaan A. Terwijn |
Fixed point theorems for precomplete numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.06233, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
24 | Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies |
From Eventually Different Functions to Pandemic Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings, pp. 97-106, 2018, Springer, 978-3-319-94417-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi |
Friedberg numberings in the Ershov hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 54(1-2), pp. 59-73, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Kuanysh Abeshev |
On the existence of universal numberings for finite families of d.c.e. sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 60(3), pp. 161-167, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Dieter Spreen |
An Isomorphism Theorem for Partial Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic, Computation, Hierarchies ![In: Logic, Computation, Hierarchies, pp. 341-382, 2014, De Gruyter, 978-1-61451-804-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Dieter Spreen |
Partial Numberings and Precompleteness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic, Computation, Hierarchies ![In: Logic, Computation, Hierarchies, pp. 325-340, 2014, De Gruyter, 978-1-61451-804-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Paul Tarau |
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 13(4-5), pp. 847-861, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov |
Inductive inference and computable numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(18), pp. 1652-1668, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Frank Stephan 0001, Jason Teutsch |
Index sets and universal numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 77(4), pp. 760-773, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Frank Stephan 0001 |
Numberings optimal for learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 76(3-4), pp. 233-250, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Frank Stephan 0001 |
Learning in Friedberg numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 206(6), pp. 776-790, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Frank Stephan 0001 |
Numberings Optimal for Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings, pp. 434-448, 2008, Springer, 978-3-540-87986-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Serikzhan A. Badaev, Dieter Spreen |
A note on partial numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 51(2), pp. 129-136, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Wolfram Menzel, Frank Stephan 0001 |
Topological aspects of numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 49(2), pp. 129-149, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Serikzhan A. Badaev |
Computable Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings, pp. 213, 2003, Springer, 3-540-20101-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Jochen Nessel |
Some Independence Results for Control Structures in Complete Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 66(1), pp. 357-382, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Dieter Spreen |
Representations versus numberings: on the relationship of two computability notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 262(1), pp. 473-499, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Fred S. Annexstein, Kenneth A. Berman |
Directional Routing via Generalized st-Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 13(2), pp. 268-279, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Günter Schaar |
On special numberings of hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 213(1-3), pp. 261-268, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Yuri Leonidovich Ershov |
Theory of Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 473-503, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Rusins Freivalds, Sanjay Jain 0001 |
Kolmogorov Numberings and Minimal Identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 188(1-2), pp. 175-194, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Sanjay Jain 0001, Arun Sharma 0001 |
Characterizing Language Identification in Terms of Computable Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 84(1), pp. 51-72, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997, pp. 12-23, 1997, Carleton Scientific. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
24 | Ganesh Baliga, Anil M. Shende |
Learning-Theoretic Perspectives of Acceptable Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 17(3-4), pp. 177-187, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Dieter Spreen |
Representations versus Numberings: On Two Computability Notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996, pp. 387-401, 1996, Springer-Verlag, Singapore, 981-3083-14-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
24 | Sanjay Jain 0001 |
An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 6(1), pp. 89-94, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Rusins Freivalds, Sanjay Jain 0001 |
Kolmogorov numberings and minimal identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroCOLT ![In: Computational Learning Theory, Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995, Proceedings, pp. 182-195, 1995, Springer, 3-540-59119-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Joseph Cheriyan, John H. Reif |
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 14(4), pp. 435-451, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Sergei L. Bezrukov, Norbert Grünwald, Karl Weber |
On Edge Numberings of the n-Cube Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 46(2), pp. 99-116, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
24 | Hartmut Walravens |
New Developments in Standard Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Essen Symposium ![In: Resource Sharing: New Technologies as a Must for Universal Avaiability of Information. 16th International Essen Symposium, 18-21 October 1993, Festschrift in honor of Hans-Peter Geh., pp. 149-162, 1993, Universitäsbibliothek Essen, 3-922602-18-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
24 | Martin Kummer |
Some applications of computable one-one numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 30(4), pp. 219-230, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. Cybern. ![In: J. Inf. Process. Cybern. 25(5/6), pp. 239-243, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP BibTeX RDF |
|
24 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 34(6), pp. 531-539, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Kathy Williamson Hoke |
Completely unimodal numberings of a simple polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 20(1), pp. 69-81, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Martin Kummer |
Numberings of R1 union F. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings, pp. 166-186, 1988, Springer, 3-540-51659-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | M. A. Iordanskii |
Minimal Numberings of the Vertices of Trees - Approximate Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings, pp. 214-217, 1987, Springer, 3-540-18740-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 30(9-11), pp. 145-164, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
24 | Gregory A. Riccardi |
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 28(20-21), pp. 285-296, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
Inductive Inference and Computable One-One Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 28(27-32), pp. 463-479, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Juris Hartmanis |
A Note on Natural Complete Sets and Gödel Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 17, pp. 75-89, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Angelika Reiser, Klaus Weihrauch |
Natural Numberings and Generalized Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. Cybern. ![In: J. Inf. Process. Cybern. 16(1-3), pp. 11-20, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP BibTeX RDF |
|
24 | Michael Machtey, Karl Winklmann, Paul Young |
Simple Gödel Numberings, Isomorphisms, and Programming Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 7(1), pp. 39-60, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
24 | Jefim Kinber |
On btt-Degrees of Sets of Minimal Numbers in Gödel Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 23(13-15), pp. 201-212, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
24 | Michael Machtey, Paul Young |
Simple Gödel Numberings, Translations, and the P-Hierarchy ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA, pp. 236-243, 1976, ACM. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
24 | Claus-Peter Schnorr |
Optimal Enumerations and Optimal Gödel Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 8(2), pp. 182-191, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
24 | Juris Hartmanis, Theodore P. Baker |
On Simple Gödel Numberings and Translations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 4(1), pp. 1-11, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
24 | Claus-Peter Schnorr |
Optimal Gödel Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP Congress (1) ![In: Information Processing, Proceedings of IFIP Congress 1971, Volume 1 - Foundations and Systems, Ljubljana, Yugoslavia, August 23-28, 1971., pp. 56-58, 1971, North-Holland, 0-7204-2063-6. The full citation details ...](Pics/full.jpeg) |
1971 |
DBLP BibTeX RDF |
|
24 | Hartley Rogers Jr. |
Godel Numberings of Partial Recursive Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 23(3), pp. 331-341, 1958. The full citation details ...](Pics/full.jpeg) |
1958 |
DBLP DOI BibTeX RDF |
|
19 | Riadh Khennoufa, Olivier Togni |
Multilevel Bandwidth and Radio Labelings of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 234-239, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
generalized graph bandwidth, radio labeling, frequency assignment |
19 | Victor L. Selivanov |
A Useful Undecidable Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 685-694, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice |
19 | Serikzhan A. Badaev |
On Rogers Semilattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 704-706, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Charalampos Papamanthou, Ioannis G. Tollis |
Parameterized st -Orientations of Graphs: Algorithms and Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 220-233, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | L. Ya. Savel'ev |
An Algorithm for Partitioning a Set into Simple Parts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 31(6), pp. 293-300, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Emo Welzl |
Geometric Optimization and Unique Sink Orientations of Cubes p. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 176, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Fault Tolerant Algorithms for Orderings and Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Martin Kummer |
On the Complexity of Random Strings (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 25-36, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Joseph Cheriyan, John H. Reif |
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 335-344, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
19 | Dieter Spreen |
Computable One-to-one Enumerations of Effective Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings, pp. 372-384, 1987, Springer, 3-540-19020-1. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Alan Gibbons, Wojciech Rytter |
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 453-469, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|