×

zbMATH — the first resource for mathematics

Köbler, Johannes

Compute Distance To:
Author ID: kobler.johannes Recent zbMATH articles by "Köbler, Johannes"
Published as: Köbler, Johannes; Köbler, J.; Köhler, Johannes; Köhler, J.; Koebler, J.; Koehler, J.
External Links: MGP
Documents Indexed: 97 Publications since 1987, including 1 Book

Publications by Year

Citations contained in zbMATH Open

70 Publications have been cited 404 times in 275 Documents Cited by Year
The graph isomorphism problem: its structural complexity. Zbl 0813.68103
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
70
1993
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
36
1987
Optimal proof systems imply complete sets for promise classes. Zbl 1029.03048
Köbler, Johannes; Messner, Jochen; Torán, Jacobo
20
2003
On counting and approximation. Zbl 0663.03025
Köbler, Johannes; Schöning, Uwe; Toran, Jacobo
19
1989
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
New collapse consequences of NP having small circuits. Zbl 0920.03052
Köbler, Johannes; Watanabe, Osamu
15
1998
The power of the middle bit of a \(\#\)P function. Zbl 0849.68036
Green, Frederic; Köbler, Johannes; Regan, Kenneth W.; Schwentick, Thomas; Torán, Jacobo
15
1995
Completeness results for graph isomorphism. Zbl 1054.68101
Jenner, Birgit; Köbler, Johannes; McKenzie, Pierre; Torán, Jacobo
13
2003
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
12
1992
Graph isomorphism is low for PP. Zbl 0770.68055
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
12
1992
On pseudorandomness and resource-bounded measure. Zbl 0974.68063
Arvind, V.; Köbler, J.
9
2001
Interval graphs: canonical representations in logspace. Zbl 1235.05140
Köbler, Johannes; Kuhnert, Sebastian; Laubner, Bastian; Verbitsky, Oleg
8
2011
On resource-bounded measure and pseudorandomness. Zbl 0889.03029
Arvind, V.; Köbler, J.
7
1997
Nondeterministic functions and the existence of optimal proof systems. Zbl 1171.68010
Beyersdorff, Olaf; Köbler, Johannes; Messner, Jochen
7
2009
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
6
1995
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. Zbl 1059.68043
Arvind, V.; Köbler, Johannes
6
2002
On graph isomorphism for restricted graph classes. Zbl 1145.68435
Köbler, Johannes
6
2006
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. Zbl 1355.68124
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
6
2016
Locating \(P\)/poly optimally in the extended low hierarchy. Zbl 0834.68032
Köbler, J.
5
1994
On bounded truth-table, conjunctive, and randomized reductions to sparse sets. Zbl 0919.03034
Arvind, V.; Köbler, J.; Mundhenk, M.
5
1992
Complete problems for promise classes by optimal proof systems for test sets. Zbl 0935.68097
Köbler, Johannes; Messner, Jochen
5
1998
A logspace algorithm for partial 2-tree canonization. Zbl 1142.68368
Arvind, Vikraman; Das, Bireswar; Köbler, Johannes
5
2008
From invariants to canonization in parallel. Zbl 1142.68354
Köbler, Johannes; Verbitsky, Oleg
5
2008
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1250.68120
Köbler, Johannes; Kuhnert, Sebastian
5
2009
The space complexity of \(k\)-tree isomorphism. Zbl 1193.68124
Arvind, V.; Das, Bireswar; Köbler, Johannes
4
2007
Upper bounds for the complexity of sparse and tally descriptions. Zbl 0840.68041
Arvind, V.; Köbler, J.; Mundhenk, M.
4
1996
Complexity-restricted advice functions. Zbl 0804.68049
Köbler, Johannes; Thierauf, Thomas
4
1994
Is the standard proof system for SAT p-optimal? (Extended abstract). Zbl 1044.03541
Köbler, Johannes; Messner, Jochen
4
2000
On hypergraph and graph isomorphism with bounded color classes. Zbl 1136.68446
Arvind, V.; Köbler, Johannes
4
2006
On the power of generalized MOD-classes. Zbl 0840.68044
Köbler, J.; Toda, Seinosuke
3
1996
Graph isomorphism is low for ZPP(NP) and other lowness results. Zbl 0962.68072
Arvind, Vikraman; Köbler, Johannes
3
2000
On reasonable and forced goal orderings and their use in agenda-driven planning algorithm. Zbl 0946.68130
Koehler, J.; Hoffmann, J.
3
2000
Error bounds for regularized solutions of nonlinear ill-posed problems. Zbl 0833.65049
Köhler, J.; Tautenhahn, U.
3
1995
Nondeterministic instance complexity and proof systems with advice. Zbl 1234.03035
Beyersdorff, Olaf; Köbler, Johannes; Müller, Sebastian
3
2009
Helly circular-arc graph isomorphism is in logspace. Zbl 1388.68126
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
3
2013
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1308.68061
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
3
2015
Nondeterministic instance complexity and hard-to-prove tautologies. Zbl 0962.68154
Arvind, Vikraman; Köbler, Johannes; Mundhenk, Martin; Torán, Jacobo
2
2000
High sets for NP. Zbl 0876.68043
Köbler, Johannes; Schöning, Uwe
2
1997
On helping and interactive proof systems. Zbl 0830.68111
Arvind, V.; Köbler, J.; Schuler, R.
2
1995
Locating P/poly optimally in the extended low hierarchy. Zbl 0793.68065
Köbler, Johannes
2
1993
Lowness and the complexity of sparse and tally descriptions. Zbl 0925.68214
Arvind, V.; Koebler, J.; Mundhenk, M.
2
1992
Average-case intractability vs. worst-case intractability. Zbl 1085.68057
Köbler, Johannes; Schuler, Rainer
2
2004
A general dimension for query learning. Zbl 1121.68059
Balcázar, José L.; Castro, Jorge; Guijarro, David; Köbler, Johannes; Lindner, Wolfgang
2
2007
The complexity of learning concept classes with polynomial general dimension. Zbl 1086.68064
Köbler, Johannes; Lindner, Wolfgang
2
2006
Interval graphs: canonical representation in logspace. Zbl 1288.05281
Köbler, Johannes; Kuhnert, Sebastian; Laubner, Bastian; Verbitsky, Oleg
2
2010
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1245.68098
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
2
2010
Approximate graph isomorphism. Zbl 1365.68464
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Vasudev, Yadu
2
2012
Interval graph representation with given interval and intersection lengths. Zbl 1336.05134
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu
2
2015
Nonlinear reference tracking: an economic model predictive control perspective. Zbl 1423.93146
Köhler, Johannes; Müller, Matthias A.; Allgöwer, Frank
2
2019
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. Zbl 1354.68125
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
2
2012
Graph isomorphism, color refinement, and compactness. Zbl 1379.05080
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
2
2017
Canonizing hypergraphs under abelian group action. Zbl 1286.05162
Arvind, V.; Köbler, Johannes
1
2011
On helping and interactive proof systems. Zbl 0953.68554
Arvind, V.; Köbler, J.; Schuler, R.
1
1994
Oracles in \(\Sigma_2^p\) are sufficient for exact learning. Zbl 0969.68089
Köhler, Johannes; Lindner, Wolfgang
1
2000
Average-case intractability vs. worst-case intractability. Zbl 0914.68079
Köbler, Johannes; Schuler, Rainer
1
1998
On the resource bounded measure of \(P\)/poly (extended abstract). Zbl 0935.68040
Köbler, Johannes; Lindner, Wolfgang
1
1998
Hausdorff reductions to sparse sets and to sets of high information content. Zbl 0925.03184
Arvind, V.; Köbler, J.; Mundhenk, M.
1
1993
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
Parameterized complexity of small weight automorphisms. Zbl 1402.68080
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2017
Around and beyond the isomorphism problem for interval graphs. Zbl 1394.68187
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
1
2012
Learning Boolean functions under the uniform distribution via the Fourier transform. Zbl 1169.68449
Köbler, Johannes; Lindner, Wolfgang
1
2006
Parameterized learnability of juntas. Zbl 1194.68186
Arvind, V.; Köbler, Johannes; Lindner, Wolfgang
1
2009
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1253.68161
Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian
1
2012
Interval graph representation with given interval and intersection lengths. Zbl 1260.05103
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu
1
2012
Proof systems that take advice. Zbl 1222.03062
Beyersdorff, Olaf; Köbler, Johannes; Müller, Sebastian
1
2011
On the power of color refinement. Zbl 1436.05101
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
1
2015
New collapse consequences of NP having small circuits. Zbl 1412.68067
Köbler, Johannes; Watanabe, Osamu
1
1995
Solving linear equations parameterized by Hamming weight. Zbl 1350.68124
Arvind, V.; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2016
Dissipativity properties in constrained optimal control: a computational approach. Zbl 1441.93073
Berberich, Julian; Köhler, Johannes; Allgöwer, Frank; Müller, Matthias A.
1
2020
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 1450.05056
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
1
2020
Dissipativity properties in constrained optimal control: a computational approach. Zbl 1441.93073
Berberich, Julian; Köhler, Johannes; Allgöwer, Frank; Müller, Matthias A.
1
2020
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 1450.05056
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
1
2020
Nonlinear reference tracking: an economic model predictive control perspective. Zbl 1423.93146
Köhler, Johannes; Müller, Matthias A.; Allgöwer, Frank
2
2019
Graph isomorphism, color refinement, and compactness. Zbl 1379.05080
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
2
2017
Parameterized complexity of small weight automorphisms. Zbl 1402.68080
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2017
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. Zbl 1355.68124
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
6
2016
Solving linear equations parameterized by Hamming weight. Zbl 1350.68124
Arvind, V.; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2016
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1308.68061
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
3
2015
Interval graph representation with given interval and intersection lengths. Zbl 1336.05134
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu
2
2015
On the power of color refinement. Zbl 1436.05101
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
1
2015
Helly circular-arc graph isomorphism is in logspace. Zbl 1388.68126
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
3
2013
Approximate graph isomorphism. Zbl 1365.68464
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Vasudev, Yadu
2
2012
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. Zbl 1354.68125
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
2
2012
Around and beyond the isomorphism problem for interval graphs. Zbl 1394.68187
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg
1
2012
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1253.68161
Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian
1
2012
Interval graph representation with given interval and intersection lengths. Zbl 1260.05103
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu
1
2012
Interval graphs: canonical representations in logspace. Zbl 1235.05140
Köbler, Johannes; Kuhnert, Sebastian; Laubner, Bastian; Verbitsky, Oleg
8
2011
Canonizing hypergraphs under abelian group action. Zbl 1286.05162
Arvind, V.; Köbler, Johannes
1
2011
Proof systems that take advice. Zbl 1222.03062
Beyersdorff, Olaf; Köbler, Johannes; Müller, Sebastian
1
2011
Interval graphs: canonical representation in logspace. Zbl 1288.05281
Köbler, Johannes; Kuhnert, Sebastian; Laubner, Bastian; Verbitsky, Oleg
2
2010
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1245.68098
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
2
2010
Nondeterministic functions and the existence of optimal proof systems. Zbl 1171.68010
Beyersdorff, Olaf; Köbler, Johannes; Messner, Jochen
7
2009
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1250.68120
Köbler, Johannes; Kuhnert, Sebastian
5
2009
Nondeterministic instance complexity and proof systems with advice. Zbl 1234.03035
Beyersdorff, Olaf; Köbler, Johannes; Müller, Sebastian
3
2009
Parameterized learnability of juntas. Zbl 1194.68186
Arvind, V.; Köbler, Johannes; Lindner, Wolfgang
1
2009
A logspace algorithm for partial 2-tree canonization. Zbl 1142.68368
Arvind, Vikraman; Das, Bireswar; Köbler, Johannes
5
2008
From invariants to canonization in parallel. Zbl 1142.68354
Köbler, Johannes; Verbitsky, Oleg
5
2008
The space complexity of \(k\)-tree isomorphism. Zbl 1193.68124
Arvind, V.; Das, Bireswar; Köbler, Johannes
4
2007
A general dimension for query learning. Zbl 1121.68059
Balcázar, José L.; Castro, Jorge; Guijarro, David; Köbler, Johannes; Lindner, Wolfgang
2
2007
On graph isomorphism for restricted graph classes. Zbl 1145.68435
Köbler, Johannes
6
2006
On hypergraph and graph isomorphism with bounded color classes. Zbl 1136.68446
Arvind, V.; Köbler, Johannes
4
2006
The complexity of learning concept classes with polynomial general dimension. Zbl 1086.68064
Köbler, Johannes; Lindner, Wolfgang
2
2006
Learning Boolean functions under the uniform distribution via the Fourier transform. Zbl 1169.68449
Köbler, Johannes; Lindner, Wolfgang
1
2006
Average-case intractability vs. worst-case intractability. Zbl 1085.68057
Köbler, Johannes; Schuler, Rainer
2
2004
Optimal proof systems imply complete sets for promise classes. Zbl 1029.03048
Köbler, Johannes; Messner, Jochen; Torán, Jacobo
20
2003
Completeness results for graph isomorphism. Zbl 1054.68101
Jenner, Birgit; Köbler, Johannes; McKenzie, Pierre; Torán, Jacobo
13
2003
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. Zbl 1059.68043
Arvind, V.; Köbler, Johannes
6
2002
On pseudorandomness and resource-bounded measure. Zbl 0974.68063
Arvind, V.; Köbler, J.
9
2001
Is the standard proof system for SAT p-optimal? (Extended abstract). Zbl 1044.03541
Köbler, Johannes; Messner, Jochen
4
2000
Graph isomorphism is low for ZPP(NP) and other lowness results. Zbl 0962.68072
Arvind, Vikraman; Köbler, Johannes
3
2000
On reasonable and forced goal orderings and their use in agenda-driven planning algorithm. Zbl 0946.68130
Koehler, J.; Hoffmann, J.
3
2000
Nondeterministic instance complexity and hard-to-prove tautologies. Zbl 0962.68154
Arvind, Vikraman; Köbler, Johannes; Mundhenk, Martin; Torán, Jacobo
2
2000
Oracles in \(\Sigma_2^p\) are sufficient for exact learning. Zbl 0969.68089
Köhler, Johannes; Lindner, Wolfgang
1
2000
New collapse consequences of NP having small circuits. Zbl 0920.03052
Köbler, Johannes; Watanabe, Osamu
15
1998
Complete problems for promise classes by optimal proof systems for test sets. Zbl 0935.68097
Köbler, Johannes; Messner, Jochen
5
1998
Average-case intractability vs. worst-case intractability. Zbl 0914.68079
Köbler, Johannes; Schuler, Rainer
1
1998
On the resource bounded measure of \(P\)/poly (extended abstract). Zbl 0935.68040
Köbler, Johannes; Lindner, Wolfgang
1
1998
On resource-bounded measure and pseudorandomness. Zbl 0889.03029
Arvind, V.; Köbler, J.
7
1997
High sets for NP. Zbl 0876.68043
Köbler, Johannes; Schöning, Uwe
2
1997
Upper bounds for the complexity of sparse and tally descriptions. Zbl 0840.68041
Arvind, V.; Köbler, J.; Mundhenk, M.
4
1996
On the power of generalized MOD-classes. Zbl 0840.68044
Köbler, J.; Toda, Seinosuke
3
1996
The power of the middle bit of a \(\#\)P function. Zbl 0849.68036
Green, Frederic; Köbler, Johannes; Regan, Kenneth W.; Schwentick, Thomas; Torán, Jacobo
15
1995
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
6
1995
Error bounds for regularized solutions of nonlinear ill-posed problems. Zbl 0833.65049
Köhler, J.; Tautenhahn, U.
3
1995
On helping and interactive proof systems. Zbl 0830.68111
Arvind, V.; Köbler, J.; Schuler, R.
2
1995
New collapse consequences of NP having small circuits. Zbl 1412.68067
Köbler, Johannes; Watanabe, Osamu
1
1995
Locating \(P\)/poly optimally in the extended low hierarchy. Zbl 0834.68032
Köbler, J.
5
1994
Complexity-restricted advice functions. Zbl 0804.68049
Köbler, Johannes; Thierauf, Thomas
4
1994
On helping and interactive proof systems. Zbl 0953.68554
Arvind, V.; Köbler, J.; Schuler, R.
1
1994
The graph isomorphism problem: its structural complexity. Zbl 0813.68103
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
70
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
Locating P/poly optimally in the extended low hierarchy. Zbl 0793.68065
Köbler, Johannes
2
1993
Hausdorff reductions to sparse sets and to sets of high information content. Zbl 0925.03184
Arvind, V.; Köbler, J.; Mundhenk, M.
1
1993
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
12
1992
Graph isomorphism is low for PP. Zbl 0770.68055
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo
12
1992
On bounded truth-table, conjunctive, and randomized reductions to sparse sets. Zbl 0919.03034
Arvind, V.; Köbler, J.; Mundhenk, M.
5
1992
Lowness and the complexity of sparse and tally descriptions. Zbl 0925.68214
Arvind, V.; Koebler, J.; Mundhenk, M.
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
On counting and approximation. Zbl 0663.03025
Köbler, Johannes; Schöning, Uwe; Toran, Jacobo
19
1989
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
36
1987
all top 5

Cited by 358 Authors

28 Köbler, Johannes
20 Arvind, Vikraman
19 Hemaspaandra, Lane A.
10 Beyersdorff, Olaf
10 Vinodchandran, N. Variyam
8 Kuhnert, Sebastian
8 Ogihara, Mitsunori
8 Rothe, Jörg-Matthias
8 Toda, Seinosuke
8 Torán, Jacobo
7 Das, Bireswar
7 Glaßer, Christian
6 Selivanov, Viktor L’vovich
6 Watanabe, Osamu
5 Allender, Eric W.
5 Beigel, Richard
5 Cai, Jin-Yi
5 Fortnow, Lance J.
5 Hemaspaandra, Edith
5 Selman, Alan L.
5 Verbitsky, Oleg
4 Sadowski, Zenon
4 Thierauf, Thomas
4 Vollmer, Heribert
4 Wagner, Klaus W.
3 Balcázar, José Luis
3 Chang, Richard
3 Dose, Titus
3 Hitchcock, John M.
3 Kurur, Piyush P.
3 Lindner, Wolfgang
3 Lohrey, Markus
3 Mahajan, Meena
3 Müller, Sebastian
3 Mundhenk, Martin
3 Nagoya, Takayuki
3 Ogiwara, Mitsunori
3 Pavan, Aduri
3 Schöning, Uwe
3 Schweitzer, Pascal
3 Sengupta, Samik
3 Spakowski, Holger
3 Wagner, Fabian
3 Wechsung, Gerd
2 Borchert, Bernd
2 Buss, Samuel R.
2 Chakaravarthy, Venkatesan T.
2 Chen, Yijia
2 Cucker, Felipe
2 Datta, Samir
2 Dvořák, Pavel
2 Faliszewski, Piotr
2 Fenner, Stephen A.
2 Fernau, Henning
2 Flum, Jörg
2 Gasarch, William Ian
2 Grochow, Joshua A.
2 Hay, Louise
2 Hempel, Harald
2 Hermann, Miki
2 Jenner, Birgit
2 Kawachi, Akinori
2 Klavík, Pavel
2 Ko, Ker-I
2 Kolaitis, Phokion G.
2 Kosub, Sven
2 Kurtz, Stuart A.
2 Long, Timothy J.
2 Messner, Jochen
2 Moser, Philippe
2 Pichler, Reinhard
2 Priami, Corrado
2 Raghavendra Rao, B. V.
2 Rattan, Gaurav
2 Romanel, Alessandro
2 Roy, Sambuddha
2 Saitoh, Toshiki
2 Sarma M. N., Jayalal
2 Schuler, Rainer
2 Sheu, Ming-Jye
2 Soulignac, Francisco Juan
2 Thakur, Mayur
2 Tripathi, Rahul
2 Uehara, Ryuhei
2 Vadhan, Salil P.
2 Valla, Tomáš
2 Yu, Fuxiang
1 Agrawal, Manindra
1 Alcón, Liliana
1 Allgower, Frank
1 Àlvarez, Carme
1 Ambos-Spies, Klaus
1 Amir, Amihood
1 Arias, Marta
1 Auddy, Arnab
1 Aurora, Pawan Kumar
1 Bäckström, Christer
1 Bakali, Eleni
1 Barak, Boaz
1 Barth, Dominik
...and 258 more Authors
all top 5

Cited in 56 Serials

58 Theoretical Computer Science
32 Journal of Computer and System Sciences
23 Information and Computation
17 Theory of Computing Systems
13 Information Processing Letters
8 Mathematical Systems Theory
8 Computational Complexity
7 Algorithmica
5 Discrete Applied Mathematics
5 International Journal of Foundations of Computer Science
4 Annals of Pure and Applied Logic
4 RAIRO. Informatique Théorique et Applications
3 Automatica
3 Mathematical Logic Quarterly (MLQ)
3 Journal of Graph Algorithms and Applications
2 Discrete Mathematics
2 Journal of Graph Theory
2 SIAM Journal on Computing
2 Journal of Cryptology
2 Archive for Mathematical Logic
2 The Bulletin of Symbolic Logic
2 Annals of Mathematics and Artificial Intelligence
2 RAIRO. Theoretical Informatics and Applications
2 Journal of Discrete Algorithms
2 Computer Science Review
2 ACM Transactions on Computation Theory
1 Artificial Intelligence
1 Mathematics of Computation
1 Information Sciences
1 Journal of Algebra
1 Journal of Applied Probability
1 Journal of Combinatorial Theory. Series A
1 Synthese
1 European Journal of Combinatorics
1 Journal of Symbolic Computation
1 Journal of Complexity
1 Journal of Computer Science and Technology
1 Discrete & Computational Geometry
1 SIAM Journal on Discrete Mathematics
1 Computational Statistics
1 International Journal of Computer Mathematics
1 Linear Algebra and its Applications
1 Pattern Recognition
1 Mathematical Programming. Series A. Series B
1 Foundations of Computing and Decision Sciences
1 Computational Optimization and Applications
1 The Journal of Artificial Intelligence Research (JAIR)
1 Complexity
1 Constraints
1 Journal of Combinatorial Optimization
1 Data Mining and Knowledge Discovery
1 LMS Journal of Computation and Mathematics
1 Foundations of Physics
1 Logical Methods in Computer Science
1 Mathematical Programming Computation
1 Prikladnaya Diskretnaya Matematika

Citations by Year