×
Author ID: schoning.uwe Recent zbMATH articles by "Schöning, Uwe"
Published as: Schöning, Uwe; Schoening, Uwe; Schöning, U.

Publications by Year

Citations contained in zbMATH Open

70 Publications have been cited 895 times in 601 Documents Cited by Year
The graph isomorphism problem: its structural complexity. Zbl 0813.68103
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
92
1993
A low and a high hierarchy within NP. Zbl 0515.68046
Schoening, Uwe
61
1983
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
46
1987
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. Zbl 1061.68071
Dantsin, Evgeny; Goerdt, Andreas; Hirsch, Edward A.; Kannan, Ravi; Kleinberg, Jon; Papadimitriou, Christos; Raghavan, Prabhakar; Schöning, Uwe
45
2002
Graph isomorphism is in the low hierarchy. Zbl 0666.68048
Schöning, Uwe
44
1988
Bi-immune sets for complexity classes. Zbl 0572.68035
Balcázar, José L.; Schöning, Uwe
42
1985
On circuit-size complexity and the low hierarchy in NP. Zbl 0562.68033
Ko, Ker-I; Schöning, Uwe
30
1985
Probabilistic complexity classes and lowness. Zbl 0688.68045
Schöning, Uwe
29
1989
Complexity of Presburger arithmetic with fixed quantifier dimension. Zbl 0872.68048
Schöning, U.
29
1997
A uniform approach to obtain diagonal sets in complexity classes. Zbl 0485.68039
Schoening, Uwe
27
1982
The polynomial-time hierarchy and sparse oracles. Zbl 0625.68033
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe
27
1986
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart. Zbl 1050.68049
Schöning, U.
24
2002
Immunity, relativizations, and nondeterminism. Zbl 0558.68039
Schöning, Uwe; Book, Ronald V.
23
1984
On counting and approximation. Zbl 0663.03025
Köbler, Johannes; Schöning, Uwe; Toran, Jacobo
21
1989
Complexity and structure. Zbl 0589.03022
Schöning, Uwe
21
1986
Sparse sets, lowness and highness. Zbl 0621.68033
Balćzar, José L.; Book, Ronald V.; Schöning, Uwe
20
1986
Complete sets and closeness to complexity classes. Zbl 0617.68047
Schöning, Uwe
19
1986
A probabilistic 3-SAT algorithm further improved. Zbl 1054.68138
Hofmeister, Thomas; Schöning, Uwe; Schuler, Rainer; Watanabe, Osamu
18
2002
Graph isomorphism is low for PP. Zbl 0770.68055
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
18
1992
Optimal approximations and polynomially levelable sets. Zbl 0644.68054
Orponen, Pekka; Russo, David A.; Schöning, Uwe
18
1986
Instance complexity. Zbl 0807.68035
Orponen, Pekka; Ko, Ker-I; Schöning, Uwe; Watanabe, Osamu
18
1994
Reductions to sets of low information content. Zbl 0794.68058
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
17
1993
Robust algorithms: a different approach to oracles. Zbl 0574.68041
Schöning, Uwe
16
1985
Turing machines with few accepting computations and low sets for PP. Zbl 0757.68056
Köbler, Johannes; Schöning, Uwe; Toda, Seinosuke; Torán, Jacobo
14
1992
Algorithmics in exponential time. Zbl 1118.68500
Schöning, Uwe
13
2005
The density and complexity of polynomial cores for intractable sets. Zbl 0611.68021
Orponen, Pekka; Schöning, Uwe
12
1986
Collapsing oracle hierarchies, census functions and logarithmically many queries. Zbl 0648.68065
Schöning, Uwe; Wagner, Klaus W.
12
1988
Logarithmic advice classes. Zbl 0761.68040
Balcázar, José L.; Schöning, Uwe
11
1992
Choosing probability distributions for stochastic local search and the role of make versus break. Zbl 1273.68333
Balint, Adrian; Schöning, Uwe
10
2012
Graph isomorphism is in the low hierarchy. Zbl 0621.68034
Schöning, Uwe
10
1987
Gems of theoretical computer science. Zbl 0911.68002
Schöning, Uwe; Pruim, Randall
10
1998
On small generators. Zbl 0558.68040
Schöning, Uwe
8
1984
The structure of polynomial complexity cores. Zbl 0556.68014
Orponen, Pekka; Schöning, Uwe
7
1984
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
7
1995
What is a hard instance of a computational problem? Zbl 0617.68048
Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu
6
1986
Minimal pairs for P. Zbl 0543.03025
Schöning, Uwe
4
1984
On bounded query machines. Zbl 0608.68038
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe
4
1985
Deterministic algorithms for \(k\)-SAT based on covering codes and local search. Zbl 0973.68253
Dantsin, Evgeny; Goerdt, Andreas; Hirsch, Edward A.; Schöning, Uwe
4
2000
Randomized algorithms for 3-SAT. Zbl 1109.68133
Hofmeister, Thomas; Schöning, Uwe; Schuler, Rainer; Watanabe, Osamu
3
2007
Logic for computer scientists. Zbl 0748.03001
Schöning, Uwe
3
1989
Untersuchungen zur Struktur von NP und verwandten Komplexitaets-klassen mit Hilfe verschiedener polynomieller Reduktionen. Zbl 0516.03036
Schoening, Uwe
3
1981
Resolution proofs, exponential bounds, and Kolmogorov complexity. Zbl 0976.03063
Schöning, Uwe
3
1997
Construction of expanders and superconcentrators using Kolmogorov complexity. Zbl 0953.68065
Schöning, Uwe
3
2000
On random reductions from sparse sets to tally sets. Zbl 0780.68044
Schöning, Uwe
3
1993
New algorithms for \(k\)-SAT based on the local search principle. Zbl 0999.68205
Schöning, Uwe
3
2001
Theoretical computer science - in brief. 3. Aufl. (Theoretische Informatik - kurzgefaßt.) Zbl 0876.68005
Schöning, Uwe
3
1997
Smaller superconcentrators of density 28. Zbl 1185.68496
Schöning, Uwe
3
2006
A note on complete sets for the polynomial-time hierarchy. Zbl 0483.68046
Schoening, Uwe
2
1981
Logic for computer scientists. Reprint of the 1989 hardback ed. Zbl 1206.03001
Schöning, Uwe
2
2008
Logik für Informatiker. 2., überarb. Aufl. Zbl 0677.03001
Schöning, Uwe
2
1989
Sparse oracles, lowness, and highness. Zbl 0554.68033
Balcázar, José L.; Book, Ronald V.; Schöning, Uwe
2
1984
Logic for computer scientists. (Logik für Informatiker.) Zbl 0637.03002
Schöning, Uwe
2
1987
Complexity cores and hard problem instances. Zbl 0819.68064
Schöning, Uwe
2
1990
High sets for NP. Zbl 0876.68043
Köbler, Johannes; Schöning, Uwe
2
1997
Graph isomorphism is low for PP. Zbl 1494.68200
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
2
1992
Reductions to sets of low information content (extended abstract). Zbl 1425.68125
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
1
1992
Theoretical computer science - in brief. (Theoretische Informatik - kurzgefaßt.) Zbl 0797.68001
Schöning, Uwe
1
1992
QuickSort from an information theoretic view. Zbl 1170.68450
List, Beatrice; Maucher, Markus; Schöning, Uwe; Schuler, Rainer
1
2009
Improving implementation of SLS solvers for SAT and new heuristics for \(k\)-SAT with long clauses. Zbl 1423.68434
Balint, Adrian; Biere, Armin; Fröhlich, Andreas; Schöning, Uwe
1
2014
Generalized polynomial-time reducibilities, degrees and NP-completeness. Zbl 0598.03030
Schöning, Uwe
1
1984
Robust oracle machines. Zbl 0652.68058
Schöning, Uwe
1
1988
Netzwerkkomplexität, probabilistische Algorithmen und Relativierungen. Zbl 0575.68050
Schöning, Uwe
1
1985
Algorithmics. (Algorithmik.) Zbl 0993.68143
Schöning, Uwe
1
2001
Complexity theory and interaction. Zbl 0661.68044
Schöning, Uwe
1
1988
Graph isomorphism is in the low hierarchy. Zbl 0797.68076
Schoening, Uwe
1
1988
An improved randomized algorithm for 3-SAT. Zbl 0991.68742
Schuler, Rainer; Schöning, Uwe; Watanabe, Osamu
1
2001
Logic for computer scientists. 4., überarb. Aufl. (Logik für Informatiker.) Zbl 0829.03001
Schöning, Uwe
1
1995
Theoretical computer science – in brief. 5th ed. (Theoretische Informatik – kurz gefasst.) Zbl 1173.68517
Schöning, Uwe
1
2008
Principles of stochastic local search. Zbl 1175.68424
Schöning, Uwe
1
2007
Promise problems on probability distributions. Zbl 1440.68348
Lorenz, Jan-Hendrik; Schöning, Uwe
1
2020
Promise problems on probability distributions. Zbl 1440.68348
Lorenz, Jan-Hendrik; Schöning, Uwe
1
2020
Improving implementation of SLS solvers for SAT and new heuristics for \(k\)-SAT with long clauses. Zbl 1423.68434
Balint, Adrian; Biere, Armin; Fröhlich, Andreas; Schöning, Uwe
1
2014
Choosing probability distributions for stochastic local search and the role of make versus break. Zbl 1273.68333
Balint, Adrian; Schöning, Uwe
10
2012
QuickSort from an information theoretic view. Zbl 1170.68450
List, Beatrice; Maucher, Markus; Schöning, Uwe; Schuler, Rainer
1
2009
Logic for computer scientists. Reprint of the 1989 hardback ed. Zbl 1206.03001
Schöning, Uwe
2
2008
Theoretical computer science – in brief. 5th ed. (Theoretische Informatik – kurz gefasst.) Zbl 1173.68517
Schöning, Uwe
1
2008
Randomized algorithms for 3-SAT. Zbl 1109.68133
Hofmeister, Thomas; Schöning, Uwe; Schuler, Rainer; Watanabe, Osamu
3
2007
Principles of stochastic local search. Zbl 1175.68424
Schöning, Uwe
1
2007
Smaller superconcentrators of density 28. Zbl 1185.68496
Schöning, Uwe
3
2006
Algorithmics in exponential time. Zbl 1118.68500
Schöning, Uwe
13
2005
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. Zbl 1061.68071
Dantsin, Evgeny; Goerdt, Andreas; Hirsch, Edward A.; Kannan, Ravi; Kleinberg, Jon; Papadimitriou, Christos; Raghavan, Prabhakar; Schöning, Uwe
45
2002
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart. Zbl 1050.68049
Schöning, U.
24
2002
A probabilistic 3-SAT algorithm further improved. Zbl 1054.68138
Hofmeister, Thomas; Schöning, Uwe; Schuler, Rainer; Watanabe, Osamu
18
2002
New algorithms for \(k\)-SAT based on the local search principle. Zbl 0999.68205
Schöning, Uwe
3
2001
Algorithmics. (Algorithmik.) Zbl 0993.68143
Schöning, Uwe
1
2001
An improved randomized algorithm for 3-SAT. Zbl 0991.68742
Schuler, Rainer; Schöning, Uwe; Watanabe, Osamu
1
2001
Deterministic algorithms for \(k\)-SAT based on covering codes and local search. Zbl 0973.68253
Dantsin, Evgeny; Goerdt, Andreas; Hirsch, Edward A.; Schöning, Uwe
4
2000
Construction of expanders and superconcentrators using Kolmogorov complexity. Zbl 0953.68065
Schöning, Uwe
3
2000
Gems of theoretical computer science. Zbl 0911.68002
Schöning, Uwe; Pruim, Randall
10
1998
Complexity of Presburger arithmetic with fixed quantifier dimension. Zbl 0872.68048
Schöning, U.
29
1997
Resolution proofs, exponential bounds, and Kolmogorov complexity. Zbl 0976.03063
Schöning, Uwe
3
1997
Theoretical computer science - in brief. 3. Aufl. (Theoretische Informatik - kurzgefaßt.) Zbl 0876.68005
Schöning, Uwe
3
1997
High sets for NP. Zbl 0876.68043
Köbler, Johannes; Schöning, Uwe
2
1997
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
7
1995
Logic for computer scientists. 4., überarb. Aufl. (Logik für Informatiker.) Zbl 0829.03001
Schöning, Uwe
1
1995
Instance complexity. Zbl 0807.68035
Orponen, Pekka; Ko, Ker-I; Schöning, Uwe; Watanabe, Osamu
18
1994
The graph isomorphism problem: its structural complexity. Zbl 0813.68103
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
92
1993
Reductions to sets of low information content. Zbl 0794.68058
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
17
1993
On random reductions from sparse sets to tally sets. Zbl 0780.68044
Schöning, Uwe
3
1993
Graph isomorphism is low for PP. Zbl 0770.68055
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
18
1992
Turing machines with few accepting computations and low sets for PP. Zbl 0757.68056
Köbler, Johannes; Schöning, Uwe; Toda, Seinosuke; Torán, Jacobo
14
1992
Logarithmic advice classes. Zbl 0761.68040
Balcázar, José L.; Schöning, Uwe
11
1992
Graph isomorphism is low for PP. Zbl 1494.68200
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
2
1992
Reductions to sets of low information content (extended abstract). Zbl 1425.68125
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
1
1992
Theoretical computer science - in brief. (Theoretische Informatik - kurzgefaßt.) Zbl 0797.68001
Schöning, Uwe
1
1992
Complexity cores and hard problem instances. Zbl 0819.68064
Schöning, Uwe
2
1990
Probabilistic complexity classes and lowness. Zbl 0688.68045
Schöning, Uwe
29
1989
On counting and approximation. Zbl 0663.03025
Köbler, Johannes; Schöning, Uwe; Toran, Jacobo
21
1989
Logic for computer scientists. Zbl 0748.03001
Schöning, Uwe
3
1989
Logik für Informatiker. 2., überarb. Aufl. Zbl 0677.03001
Schöning, Uwe
2
1989
Graph isomorphism is in the low hierarchy. Zbl 0666.68048
Schöning, Uwe
44
1988
Collapsing oracle hierarchies, census functions and logarithmically many queries. Zbl 0648.68065
Schöning, Uwe; Wagner, Klaus W.
12
1988
Robust oracle machines. Zbl 0652.68058
Schöning, Uwe
1
1988
Complexity theory and interaction. Zbl 0661.68044
Schöning, Uwe
1
1988
Graph isomorphism is in the low hierarchy. Zbl 0797.68076
Schoening, Uwe
1
1988
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
46
1987
Graph isomorphism is in the low hierarchy. Zbl 0621.68034
Schöning, Uwe
10
1987
Logic for computer scientists. (Logik für Informatiker.) Zbl 0637.03002
Schöning, Uwe
2
1987
The polynomial-time hierarchy and sparse oracles. Zbl 0625.68033
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe
27
1986
Complexity and structure. Zbl 0589.03022
Schöning, Uwe
21
1986
Sparse sets, lowness and highness. Zbl 0621.68033
Balćzar, José L.; Book, Ronald V.; Schöning, Uwe
20
1986
Complete sets and closeness to complexity classes. Zbl 0617.68047
Schöning, Uwe
19
1986
Optimal approximations and polynomially levelable sets. Zbl 0644.68054
Orponen, Pekka; Russo, David A.; Schöning, Uwe
18
1986
The density and complexity of polynomial cores for intractable sets. Zbl 0611.68021
Orponen, Pekka; Schöning, Uwe
12
1986
What is a hard instance of a computational problem? Zbl 0617.68048
Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu
6
1986
Bi-immune sets for complexity classes. Zbl 0572.68035
Balcázar, José L.; Schöning, Uwe
42
1985
On circuit-size complexity and the low hierarchy in NP. Zbl 0562.68033
Ko, Ker-I; Schöning, Uwe
30
1985
Robust algorithms: a different approach to oracles. Zbl 0574.68041
Schöning, Uwe
16
1985
On bounded query machines. Zbl 0608.68038
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe
4
1985
Netzwerkkomplexität, probabilistische Algorithmen und Relativierungen. Zbl 0575.68050
Schöning, Uwe
1
1985
Immunity, relativizations, and nondeterminism. Zbl 0558.68039
Schöning, Uwe; Book, Ronald V.
23
1984
On small generators. Zbl 0558.68040
Schöning, Uwe
8
1984
The structure of polynomial complexity cores. Zbl 0556.68014
Orponen, Pekka; Schöning, Uwe
7
1984
Minimal pairs for P. Zbl 0543.03025
Schöning, Uwe
4
1984
Sparse oracles, lowness, and highness. Zbl 0554.68033
Balcázar, José L.; Book, Ronald V.; Schöning, Uwe
2
1984
Generalized polynomial-time reducibilities, degrees and NP-completeness. Zbl 0598.03030
Schöning, Uwe
1
1984
A low and a high hierarchy within NP. Zbl 0515.68046
Schoening, Uwe
61
1983
A uniform approach to obtain diagonal sets in complexity classes. Zbl 0485.68039
Schoening, Uwe
27
1982
Untersuchungen zur Struktur von NP und verwandten Komplexitaets-klassen mit Hilfe verschiedener polynomieller Reduktionen. Zbl 0516.03036
Schoening, Uwe
3
1981
A note on complete sets for the polynomial-time hierarchy. Zbl 0483.68046
Schoening, Uwe
2
1981
all top 5

Cited by 696 Authors

52 Hemaspaandra, Lane A.
27 Köbler, Johannes
20 Arvind, Vikraman
20 Rothe, Jörg-Matthias
17 Schöning, Uwe
16 Torán, Jacobo
15 Hemaspaandra, Edith
12 Toda, Seinosuke
11 Allender, Eric W.
11 Book, Ronald Vernon
10 Beigel, Richard
10 Ogihara, Mitsunori
10 Pavan, Aduri
9 Ambos-Spies, Klaus
9 Balcázar, José Luis
9 Glaßer, Christian
9 Selman, Alan Louis
9 Vinodchandran, N. Variyam
9 Watanabe, Osamu
8 Silvestri, Riccardo
7 Cai, Jin-Yi
7 Das, Bireswar
7 Hempel, Harald
7 Ko, Ker-I
7 Spakowski, Holger
7 Wagner, Klaus W.
6 Cintioli, Patrizio
6 Downey, Rodney Graham
6 Hirsch, Edward A.
6 Long, Timothy Juris
6 Lutz, Jack H.
6 Regan, Kenneth W.
6 Thierauf, Thomas
5 Beyersdorff, Olaf
5 Faliszewski, Piotr
5 Fortnow, Lance J.
5 Grochow, Joshua A.
5 Homer, Steven
5 Jenner, Birgit
5 Jonsson, Peter
5 Mayordomo, Elvira
5 Mundhenk, Martin
5 Nguyen, Danny
5 Ogiwara, Mitsunori
5 Pak, Igor
5 Schuler, Rainer
5 Selivanov, Viktor L’vovich
5 Wechsung, Gerd
5 Yamakami, Tomoyuki
4 Buss, Samuel R.
4 Chen, Jian-er
4 Du, Ding-Zhu
4 Fomin, Fedor V.
4 Fu, Bin
4 Gasarch, William Ian
4 Goldsmith, Judy
4 Hartmanis, Juris
4 Hermo, Montserrat
4 Iwama, Kazuo
4 Nagoya, Takayuki
4 Qiao, Youming
4 Rossmanith, Peter
4 Sheu, Ming-Jye
4 Terwijn, Sebastiaan A.
4 Torenvliet, Leen
4 Vollmer, Heribert
3 Bodlaender, Hans L.
3 Borchert, Bernd
3 Cai, Shaowei
3 Crescenzi, Pierluigi
3 Cucker, Felipe
3 Dantsin, Evgeny
3 Fenner, Stephen A.
3 Hermann, Miki
3 Hitchcock, John M.
3 Hutter, Frank
3 Impagliazzo, Russell
3 Jiang, Zhigen
3 Joseph, Deborah
3 Kolaitis, Phokion G.
3 Kratsch, Dieter
3 Kuhnert, Sebastian
3 Kurur, Piyush P.
3 Lagerkvist, Victor
3 Levet, Michael
3 Lindauer, Marius
3 Lorenz, Jan-Hendrik
3 Lozano, Antoni
3 Meer, Klaus
3 Merkle, Wolfgang
3 Moore, Cristopher
3 Müller, Sebastian
3 Niedermeier, Rolf
3 Nordh, Gustav
3 Pichler, Reinhard
3 Schweitzer, Pascal
3 Shen, Haiou
3 Subramani, Krishnan
3 Tamaki, Suguru
3 Tang, Shouwen
...and 596 more Authors
all top 5

Cited in 97 Serials

129 Theoretical Computer Science
50 Journal of Computer and System Sciences
37 Information Processing Letters
30 Information and Computation
27 Mathematical Systems Theory
17 Theory of Computing Systems
15 Discrete Applied Mathematics
15 Algorithmica
15 Computational Complexity
11 Artificial Intelligence
11 Annals of Pure and Applied Logic
9 RAIRO. Informatique Théorique et Applications
8 SIAM Journal on Computing
7 Annals of Mathematics and Artificial Intelligence
5 Journal of Complexity
5 Mathematical Logic Quarterly (MLQ)
5 RAIRO. Theoretical Informatics and Applications
4 Journal of Discrete Algorithms
3 Acta Informatica
3 Synthese
3 Random Structures & Algorithms
3 International Journal of Foundations of Computer Science
3 International Journal of Computer Mathematics
3 Journal of Combinatorial Optimization
3 Mathematics in Computer Science
3 Logical Methods in Computer Science
3 Computer Science Review
2 Discrete Mathematics
2 The Journal of Symbolic Logic
2 Networks
2 Notre Dame Journal of Formal Logic
2 Journal of Automated Reasoning
2 International Journal of Approximate Reasoning
2 SIAM Journal on Discrete Mathematics
2 Journal of Cryptology
2 Archive for Mathematical Logic
2 Journal of Mathematical Sciences (New York)
2 The Journal of Artificial Intelligence Research (JAIR)
2 The Bulletin of Symbolic Logic
2 Foundations of Computational Mathematics
2 Quantum Information Processing
2 ACM Transactions on Computational Logic
2 Journal of Satisfiability, Boolean Modeling and Computation
1 Computers & Mathematics with Applications
1 Journal of the Franklin Institute
1 Journal of Mathematical Physics
1 Linear and Multilinear Algebra
1 Problems of Information Transmission
1 Mathematics of Computation
1 Computing
1 Journal of Algebra
1 Journal of Combinatorial Theory. Series A
1 Journal of Graph Theory
1 Journal of Mathematical Psychology
1 Mathematics of Operations Research
1 European Journal of Combinatorics
1 Combinatorica
1 Acta Mathematicae Applicatae Sinica. English Series
1 Graphs and Combinatorics
1 Journal of Symbolic Computation
1 Probability Theory and Related Fields
1 Journal of Computer Science and Technology
1 Discrete & Computational Geometry
1 Journal of Economic Dynamics & Control
1 Annals of Operations Research
1 Machine Learning
1 International Journal of Algebra and Computation
1 Computational Statistics
1 Linear Algebra and its Applications
1 SIAM Review
1 Mathematical Programming. Series A. Series B
1 Foundations of Computing and Decision Sciences
1 Journal of Knot Theory and its Ramifications
1 The Australasian Journal of Combinatorics
1 Formal Methods in System Design
1 Journal of Logic, Language and Information
1 Journal of Heuristics
1 Constraints
1 Journal of Automata, Languages and Combinatorics
1 Journal of Applied Mathematics and Decision Sciences
1 Data Mining and Knowledge Discovery
1 Mathematical and Computer Modelling of Dynamical Systems
1 LMS Journal of Computation and Mathematics
1 CEJOR. Central European Journal of Operations Research
1 Fundamenta Informaticae
1 Natural Computing
1 ACM Journal of Experimental Algorithmics
1 Foundations of Physics
1 Discrete Optimization
1 Optimization Letters
1 Chinese Journal of Physics (Taipei)
1 Discrete Mathematics, Algorithms and Applications
1 Forum of Mathematics, Sigma
1 Computability
1 ACM Transactions on Computation Theory
1 Mathematics
1 Prikladnaya Diskretnaya Matematika

Citations by Year