×
Compute Distance To:
Author ID: zantema.hans Recent zbMATH articles by "Zantema, Hans"
Published as: Zantema, Hans; Zantema, H.
External Links: MGP · Wikidata · dblp

Publications by Year

Citations contained in zbMATH Open

70 Publications have been cited 419 times in 249 Documents Cited by Year
Matrix interpretations for proving termination of term rewriting. Zbl 1139.68049
Endrullis, Jörg; Waldmann, Johannes; Zantema, Hans
42
2008
Integer valued polynomials over a number field. Zbl 0505.12003
Zantema, H.
38
1982
Termination of term rewriting: Interpretation and type elimination. Zbl 0810.68087
Zantema, H.
38
1994
Termination of term rewriting by semantic labelling. Zbl 0839.68050
Zantema, H.
36
1995
Termination of context-sensitive rewriting. Zbl 1379.68207
Zantema, H.
16
1997
On tree automata that certify termination of left-linear term rewriting systems. Zbl 1112.68077
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
11
2007
Termination of string rewriting proved automatically. Zbl 1102.68649
Zantema, H.
10
2005
Non-looping string rewriting. Zbl 0951.68054
Geser, Alfons; Zantema, Hans
9
1999
Total termination of term rewriting. Zbl 0847.68054
Ferreira, M. C. F.; Zantema, H.
9
1996
Simple termination of rewrite systems. Zbl 0903.68106
Middeldorp, Aart; Zantema, Hans
9
1997
Resolution and binary decision diagrams cannot simulate each other polynomially. Zbl 1029.68129
Groote, J. F.; Zantema, H.
9
2003
DFAs and PFAs with long shortest synchronizing word length. Zbl 1410.68201
de Bondt, Michiel; Don, Henk; Zantema, Hans
7
2017
A complete characterization of termination of \(0^p1^q\to 1^r0^s\). Zbl 0962.68086
Zantema, Hans; Geser, Alfons
7
2000
Matrix interpretations for proving termination of term rewriting. Zbl 1222.68362
Endrullis, Jörg; Waldmann, Johannes; Zantema, Hans
7
2006
Degrees of undecidability in term rewriting. Zbl 1257.68093
Endrullis, Jörg; Geuvers, Herman; Zantema, Hans
7
2009
Normalization of infinite terms. Zbl 1146.68042
Zantema, Hans
7
2008
Lower bounds for synchronizing word lengths in partial automata. Zbl 1415.68125
de Bondt, Michiel; Don, Henk; Zantema, Hans
6
2019
Finding finite automata that certify termination of string rewriting systems. Zbl 1097.68052
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
6
2005
Transforming termination by self-labelling. Zbl 0939.68684
Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
6
1995
Total termination of term rewriting is undecidable. Zbl 0843.68047
Zantema, Hans
6
1995
Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
6
2002
Well-definedness of streams by termination. Zbl 1239.68037
Zantema, Hans
6
2009
A transformational approach to prove outermost termination automatically. Zbl 1294.68099
Raffelsieper, Matthias; Zantema, Hans
6
2009
A computation concerning doubly transitive permutation groups. Zbl 0515.20002
Cohen, A. M.; Zantema, H.
5
1984
Levels of undecidability in rewriting. Zbl 1210.68064
Endrullis, Jörg; Geuvers, Herman; Simonsen, Jakob Grue; Zantema, Hans
5
2011
On tree automata that certify termination of left-linear term rewriting systems. Zbl 1078.68062
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
5
2005
Proving productivity in infinite data structures. Zbl 1236.68056
Zantema, Hans; Raffelsieper, Matthias
5
2010
Cinderella versus the wicked stepmother. Zbl 1362.91011
Bodlaender, Marijke Hans L.; Hurkens, Cor A. J.; Kusters, Vincent J. J.; Staals, Frank; Woeginger, Gerhard J.; Zantema, Hans
5
2012
Proving non-termination by finite automata. Zbl 1366.68115
Endrullis, Jörg; Zantema, Hans
5
2015
The degree of squares is an atom. Zbl 1330.68154
Endrullis, Jörg; Grabmayer, Clemens; Hendriks, Dimitri; Zantema, Hans
4
2015
Longest segment problems. Zbl 0745.68062
Zantema, H.
4
1992
The termination hierarchy for term rewriting. Zbl 0973.68099
Zantema, H.
4
2001
A rewriting approach to binary decision diagrams. Zbl 1015.68086
Zantema, Hans; van de Pol, Jaco
4
2001
Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
4
2002
Certification of proving termination of term rewriting by matrix interpretations. Zbl 1132.68431
Koprowski, Adam; Zantema, Hans
4
2008
Relative undecidability in term rewriting. Zbl 0884.68067
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
3
1997
Automation of recursive path ordering for infinite labelled rewrite systems. Zbl 1222.68366
Koprowski, Adam; Zantema, Hans
3
2006
Syntactical analysis of total termination. Zbl 0988.68556
Ferreira, M. C. F.; Zantema, H.
3
1994
Transforming termination by self-labelling. Zbl 1412.68112
Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
3
1996
Liveness in rewriting. Zbl 1038.68067
Giesl, Jürgen; Zantema, Hans
3
2003
Termination by quasi-periodic interpretations. Zbl 1203.68081
Zantema, Hans; Waldmann, Johannes
3
2007
Synchronizing non-deterministic finite automata. Zbl 1419.68060
Don, Henk; Zantema, Hans
2
2018
Proving termination of graph transformation systems using weighted type graphs over semirings. Zbl 1321.68326
Bruggink, H. J. Sander; König, Barbara; Nolte, Dennis; Zantema, Hans
2
2015
Global restrictions on ramification in number fields. Zbl 0519.12005
Zantema, H.
2
1983
Well-definedness of streams by transformation and termination. Zbl 1208.68110
Zantema, Hans
2
2010
Generalizing DPLL and satisfiability for equalities. Zbl 1121.68102
Badban, Bahareh; Van De Pol, Jaco; Tveretina, Olga; Zantema, Hans
2
2007
Finding finite automata that certify termination of string rewriting. Zbl 1115.68433
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
2
2005
A rewriting view of simple typing. Zbl 1272.03142
Stump, Aaron; Kimmell, Garrin; Zantema, Hans; El Haj Omar, Ruba
2
2013
Finding small equivalent decision trees is hard. Zbl 1319.68103
Zantema, Hans; Bodlaender, Hans L.
2
2000
Ordering sequences by permutation transducers. Zbl 1353.05006
Bosma, Wieb; Zantema, Hans
2
2017
Minimizing sums of addition chains. Zbl 0728.11018
Zantema, H.
2
1991
Proving liveness with fairness using rewriting. Zbl 1171.68513
Koprowski, Adam; Zantema, Hans
2
2005
Termination of cycle rewriting. Zbl 1416.68095
Zantema, Hans; König, Barbara; Bruggink, H. J. Sander
2
2014
Termination analysis for graph transformation systems. Zbl 1417.68074
Bruggink, H. J. Sander; König, Barbara; Zantema, Hans
2
2014
Finding DFAs with maximal shortest synchronizing word length. Zbl 06725141
Don, Henk; Zantema, Hans
2
2017
Classifying non-periodic sequences by permutation transducers. Zbl 06791091
Zantema, Hans; Bosma, Wieb
1
2017
Termination modulo equations by abstract commutation with an application to iteration. Zbl 0901.68090
Fokkink, Wan; Zantema, Hans
1
1997
Complexity of guided insertion-deletion in RNA-editing. Zbl 1284.68370
Zantema, Hans
1
2010
A proof system and a decision procedure for equality logic. Zbl 1196.03045
Tveretina, Olga; Zantema, Hans
1
2004
Generalized innermost rewriting. Zbl 1078.68068
van de Pol, Jaco; Zantema, Hans
1
2005
Binary decision diagrams by shared rewriting. Zbl 0996.68512
van de Pol, Jaco; Zantema, Hans
1
2000
Proving equality of streams automatically. Zbl 1236.68159
Zantema, Hans; Endrullis, Jörg
1
2011
A tool proving well-definedness of streams using termination tools. Zbl 1239.68038
Zantema, Hans
1
2009
Transforming equality logic to propositional logic. Zbl 1261.03070
Zantema, Hans; Groote, Jan Friso
1
2003
Turtle graphics of morphic sequences. Zbl 1342.28026
Zantema, Hans
1
2016
Slowly synchronizing automata with fixed alphabet size. Zbl 07373414
Don, Henk; Zantema, Hans; de Bondt, Michiel
1
2021
Resolution and binary decision diagrams cannot simulate each other polynomially. Zbl 1073.03520
Groote, Jan Friso; Zantema, Hans
1
2001
Reducing right-hand sides for termination. Zbl 1171.68520
Zantema, Hans
1
2005
Ordered binary decision diagrams, pigeonhole formulas and beyond. Zbl 1221.68105
Tveretina, Olga; Sinz, Carsten; Zantema, Hans
1
2010
Transforming cycle rewriting into string rewriting. Zbl 1366.68127
Sabel, David; Zantema, Hans
1
2015
Slowly synchronizing automata with fixed alphabet size. Zbl 07373414
Don, Henk; Zantema, Hans; de Bondt, Michiel
1
2021
Lower bounds for synchronizing word lengths in partial automata. Zbl 1415.68125
de Bondt, Michiel; Don, Henk; Zantema, Hans
6
2019
Synchronizing non-deterministic finite automata. Zbl 1419.68060
Don, Henk; Zantema, Hans
2
2018
DFAs and PFAs with long shortest synchronizing word length. Zbl 1410.68201
de Bondt, Michiel; Don, Henk; Zantema, Hans
7
2017
Ordering sequences by permutation transducers. Zbl 1353.05006
Bosma, Wieb; Zantema, Hans
2
2017
Finding DFAs with maximal shortest synchronizing word length. Zbl 06725141
Don, Henk; Zantema, Hans
2
2017
Classifying non-periodic sequences by permutation transducers. Zbl 06791091
Zantema, Hans; Bosma, Wieb
1
2017
Turtle graphics of morphic sequences. Zbl 1342.28026
Zantema, Hans
1
2016
Proving non-termination by finite automata. Zbl 1366.68115
Endrullis, Jörg; Zantema, Hans
5
2015
The degree of squares is an atom. Zbl 1330.68154
Endrullis, Jörg; Grabmayer, Clemens; Hendriks, Dimitri; Zantema, Hans
4
2015
Proving termination of graph transformation systems using weighted type graphs over semirings. Zbl 1321.68326
Bruggink, H. J. Sander; König, Barbara; Nolte, Dennis; Zantema, Hans
2
2015
Transforming cycle rewriting into string rewriting. Zbl 1366.68127
Sabel, David; Zantema, Hans
1
2015
Termination of cycle rewriting. Zbl 1416.68095
Zantema, Hans; König, Barbara; Bruggink, H. J. Sander
2
2014
Termination analysis for graph transformation systems. Zbl 1417.68074
Bruggink, H. J. Sander; König, Barbara; Zantema, Hans
2
2014
A rewriting view of simple typing. Zbl 1272.03142
Stump, Aaron; Kimmell, Garrin; Zantema, Hans; El Haj Omar, Ruba
2
2013
Cinderella versus the wicked stepmother. Zbl 1362.91011
Bodlaender, Marijke Hans L.; Hurkens, Cor A. J.; Kusters, Vincent J. J.; Staals, Frank; Woeginger, Gerhard J.; Zantema, Hans
5
2012
Levels of undecidability in rewriting. Zbl 1210.68064
Endrullis, Jörg; Geuvers, Herman; Simonsen, Jakob Grue; Zantema, Hans
5
2011
Proving equality of streams automatically. Zbl 1236.68159
Zantema, Hans; Endrullis, Jörg
1
2011
Proving productivity in infinite data structures. Zbl 1236.68056
Zantema, Hans; Raffelsieper, Matthias
5
2010
Well-definedness of streams by transformation and termination. Zbl 1208.68110
Zantema, Hans
2
2010
Complexity of guided insertion-deletion in RNA-editing. Zbl 1284.68370
Zantema, Hans
1
2010
Ordered binary decision diagrams, pigeonhole formulas and beyond. Zbl 1221.68105
Tveretina, Olga; Sinz, Carsten; Zantema, Hans
1
2010
Degrees of undecidability in term rewriting. Zbl 1257.68093
Endrullis, Jörg; Geuvers, Herman; Zantema, Hans
7
2009
Well-definedness of streams by termination. Zbl 1239.68037
Zantema, Hans
6
2009
A transformational approach to prove outermost termination automatically. Zbl 1294.68099
Raffelsieper, Matthias; Zantema, Hans
6
2009
A tool proving well-definedness of streams using termination tools. Zbl 1239.68038
Zantema, Hans
1
2009
Matrix interpretations for proving termination of term rewriting. Zbl 1139.68049
Endrullis, Jörg; Waldmann, Johannes; Zantema, Hans
42
2008
Normalization of infinite terms. Zbl 1146.68042
Zantema, Hans
7
2008
Certification of proving termination of term rewriting by matrix interpretations. Zbl 1132.68431
Koprowski, Adam; Zantema, Hans
4
2008
On tree automata that certify termination of left-linear term rewriting systems. Zbl 1112.68077
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
11
2007
Termination by quasi-periodic interpretations. Zbl 1203.68081
Zantema, Hans; Waldmann, Johannes
3
2007
Generalizing DPLL and satisfiability for equalities. Zbl 1121.68102
Badban, Bahareh; Van De Pol, Jaco; Tveretina, Olga; Zantema, Hans
2
2007
Matrix interpretations for proving termination of term rewriting. Zbl 1222.68362
Endrullis, Jörg; Waldmann, Johannes; Zantema, Hans
7
2006
Automation of recursive path ordering for infinite labelled rewrite systems. Zbl 1222.68366
Koprowski, Adam; Zantema, Hans
3
2006
Termination of string rewriting proved automatically. Zbl 1102.68649
Zantema, H.
10
2005
Finding finite automata that certify termination of string rewriting systems. Zbl 1097.68052
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
6
2005
On tree automata that certify termination of left-linear term rewriting systems. Zbl 1078.68062
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
5
2005
Finding finite automata that certify termination of string rewriting. Zbl 1115.68433
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans
2
2005
Proving liveness with fairness using rewriting. Zbl 1171.68513
Koprowski, Adam; Zantema, Hans
2
2005
Generalized innermost rewriting. Zbl 1078.68068
van de Pol, Jaco; Zantema, Hans
1
2005
Reducing right-hand sides for termination. Zbl 1171.68520
Zantema, Hans
1
2005
A proof system and a decision procedure for equality logic. Zbl 1196.03045
Tveretina, Olga; Zantema, Hans
1
2004
Resolution and binary decision diagrams cannot simulate each other polynomially. Zbl 1029.68129
Groote, J. F.; Zantema, H.
9
2003
Liveness in rewriting. Zbl 1038.68067
Giesl, Jürgen; Zantema, Hans
3
2003
Transforming equality logic to propositional logic. Zbl 1261.03070
Zantema, Hans; Groote, Jan Friso
1
2003
Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
6
2002
Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
4
2002
The termination hierarchy for term rewriting. Zbl 0973.68099
Zantema, H.
4
2001
A rewriting approach to binary decision diagrams. Zbl 1015.68086
Zantema, Hans; van de Pol, Jaco
4
2001
Resolution and binary decision diagrams cannot simulate each other polynomially. Zbl 1073.03520
Groote, Jan Friso; Zantema, Hans
1
2001
A complete characterization of termination of \(0^p1^q\to 1^r0^s\). Zbl 0962.68086
Zantema, Hans; Geser, Alfons
7
2000
Finding small equivalent decision trees is hard. Zbl 1319.68103
Zantema, Hans; Bodlaender, Hans L.
2
2000
Binary decision diagrams by shared rewriting. Zbl 0996.68512
van de Pol, Jaco; Zantema, Hans
1
2000
Non-looping string rewriting. Zbl 0951.68054
Geser, Alfons; Zantema, Hans
9
1999
Termination of context-sensitive rewriting. Zbl 1379.68207
Zantema, H.
16
1997
Simple termination of rewrite systems. Zbl 0903.68106
Middeldorp, Aart; Zantema, Hans
9
1997
Relative undecidability in term rewriting. Zbl 0884.68067
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
3
1997
Termination modulo equations by abstract commutation with an application to iteration. Zbl 0901.68090
Fokkink, Wan; Zantema, Hans
1
1997
Total termination of term rewriting. Zbl 0847.68054
Ferreira, M. C. F.; Zantema, H.
9
1996
Transforming termination by self-labelling. Zbl 1412.68112
Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
3
1996
Termination of term rewriting by semantic labelling. Zbl 0839.68050
Zantema, H.
36
1995
Transforming termination by self-labelling. Zbl 0939.68684
Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
6
1995
Total termination of term rewriting is undecidable. Zbl 0843.68047
Zantema, Hans
6
1995
Termination of term rewriting: Interpretation and type elimination. Zbl 0810.68087
Zantema, H.
38
1994
Syntactical analysis of total termination. Zbl 0988.68556
Ferreira, M. C. F.; Zantema, H.
3
1994
Longest segment problems. Zbl 0745.68062
Zantema, H.
4
1992
Minimizing sums of addition chains. Zbl 0728.11018
Zantema, H.
2
1991
A computation concerning doubly transitive permutation groups. Zbl 0515.20002
Cohen, A. M.; Zantema, H.
5
1984
Global restrictions on ramification in number fields. Zbl 0519.12005
Zantema, H.
2
1983
Integer valued polynomials over a number field. Zbl 0505.12003
Zantema, H.
38
1982
all top 5

Cited by 290 Authors

27 Zantema, Hans
24 Middeldorp, Aart
16 Endrullis, Jörg
15 Lucas, Salvador
11 Giesl, Jürgen
10 Thiemann, René
10 Waldmann, Johannes
8 Chabert, Jean-Luc
8 Geser, Alfons
8 Zankl, Harald
7 Hendriks, Dimitri
7 Klop, Jan Willem
7 Moser, Georg
7 Schneider-Kamp, Peter
6 Gutiérrez, Raúl
6 Hirokawa, Nao
6 Hofbauer, Dieter
5 Fuhs, Carsten
5 Maarefparvar, Abbas
5 Winkler, Sarah
4 Blanqui, Frédéric
4 Don, Henk
4 Groote, Jan Friso
4 Leriche, Amandine
4 Meseguer Guaita, José
4 Yamada, Akihisa
3 Alarcón, Beatriz
3 Catalano, Costanza
3 de Bondt, Michiel
3 Emmes, Fabian
3 Felgenhauer, Bertram
3 Geuvers, Jan Herman
3 Gnaedig, Isabelle
3 Greco, Sergio
3 Iborra, José
3 Jungers, Raphaël M.
3 Martin, Ursula
3 Nishida, Naoki
3 Rajaei, Ali
3 Roşu, Grigore
3 Sternagel, Christian
3 Trubitsyna, Irina
3 van de Pol, Jan Cornelis
3 Vidal, Germán
2 Adam, David
2 Aschermann, Cornelius
2 Avanzini, Martin
2 Badban, Bahareh
2 Bakhshi, Rena
2 Cahen, Paul-Jean
2 Calautti, Marco
2 Capretta, Venanzio
2 Codish, Michael
2 de Vrijer, Roel
2 Eguchi, Naohi
2 Fissore, Olivier
2 Frohn, Florian
2 Genet, Thomas
2 Gilmer, Robert W. jun.
2 Grabmayer, Clemens
2 Hansen, Helle Hvid
2 Hensel, Jera
2 Heule, Marijn J. H.
2 Kahrs, Stefan Michael
2 Karhumaki, Juhani
2 Kirchner, Hélène
2 Kop, Cynthia
2 Koprowski, Adam
2 Korp, Martin
2 Latteux, Michel
2 Lucanu, Dorel
2 Marché, Claude
2 Mesnard, Fred
2 Molinaro, Cristian
2 Mu, Shin-Cheng
2 Noschinski, Lars
2 Ohlebusch, Enno
2 Overbeek, Roy
2 Parting, Michael
2 Payet, Étienne
2 Roos, Yves
2 Saarela, Aleksi
2 Sénizergues, Géraud
2 Shabana, Hanan
2 Simonsen, Jakob Grue
2 Ströder, Thomas
2 Suomela, Jukka
2 Swiderski, Stephan
2 Taous, Mohammed
2 Tougma, Charles Wend-Waoga
2 Tveretina, Olga
2 Urbain, Xavier
2 Vágvölgyi, Sándor
1 Aaronson, Scott
1 Aceto, Luca
1 Adyan, Sergeĭ Ivanovich
1 Aoto, Takahito
1 Axenovich, Maria A.
1 Azfar, Umer
1 Bagnara, Roberto
...and 190 more Authors
all top 5

Cited in 58 Serials

28 Theoretical Computer Science
19 Information and Computation
19 Journal of Automated Reasoning
10 Journal of Number Theory
7 Applicable Algebra in Engineering, Communication and Computing
7 Logical Methods in Computer Science
5 Theory and Practice of Logic Programming
5 Journal of Logical and Algebraic Methods in Programming
4 Discrete Applied Mathematics
4 Information Processing Letters
4 Journal of Symbolic Computation
4 International Journal of Foundations of Computer Science
4 Journal of Functional Programming
3 Acta Informatica
3 Communications in Algebra
3 Journal of Algebra
3 Manuscripta Mathematica
2 The Journal of Symbolic Logic
2 MSCS. Mathematical Structures in Computer Science
2 Annals of Mathematics and Artificial Intelligence
2 Higher-Order and Symbolic Computation
2 The Journal of Logic and Algebraic Programming
2 ACM Transactions on Computational Logic
2 Actes des Rencontres du C.I.R.M.
2 Prikladnaya Diskretnaya Matematika
1 American Mathematical Monthly
1 Artificial Intelligence
1 Mathematical Notes
1 Archiv der Mathematik
1 Journal of Combinatorial Theory. Series A
1 Journal of Computer and System Sciences
1 Journal of Pure and Applied Algebra
1 Proceedings of the American Mathematical Society
1 Acta Mathematica Hungarica
1 Annals of Pure and Applied Logic
1 New Generation Computing
1 Formal Aspects of Computing
1 International Journal of Mathematics
1 International Journal of Computer Mathematics
1 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics
1 Indagationes Mathematicae. New Series
1 Journal of Algebraic Combinatorics
1 Formal Methods in System Design
1 Journal of Computer and Systems Sciences International
1 Journal of Applied Non-Classical Logics
1 Journal de Théorie des Nombres de Bordeaux
1 Fractals
1 Acta Mathematica Sinica. English Series
1 RAIRO. Theoretical Informatics and Applications
1 Fundamenta Informaticae
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 JP Journal of Algebra, Number Theory and Applications
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 International Journal of Number Theory
1 Confluentes Mathematici
1 Algorithms
1 Research in Number Theory
1 Ural Mathematical Journal

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.