Communication complexity method for measuring nondeterminism in finite automata. Zbl 1009.68067
Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg |
|
2002
|
Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Zbl 0853.68131
Giammarresi, Dora; Restivo, Antonio; Seibert, Sebastian; Thomas, Wolfgang |
|
1996
|
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. Zbl 1014.68093
Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas |
|
2001
|
Approximation algorithms for the TSP with sharpened triangle inequality. Zbl 1338.68289
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract). Zbl 1028.90044
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 1094.90036
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2002
|
Advice complexity of the online coloring problem. Zbl 1382.68338
Seibert, Sebastian; Sprock, Andreas; Unger, Walter |
|
2013
|
Reoptimization of the shortest common superstring problem. Zbl 1238.68189
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna |
|
2011
|
Improved lower bounds on the approximability of the traveling salesman problem. Zbl 0971.68075
Böckenhauer, Hans-Joachim; Seibert, Sebastian |
|
2000
|
Nondeterminism versus determinism of finite automata over directed acyclic graphs. Zbl 0803.68032
Potthoff, Andreas; Seibert, Sebastian; Thomas, Wolfgang |
|
1994
|
A 1.5-approximation of the minimal Manhattan network problem. Zbl 1173.68869
Seibert, Sebastian; Unger, Walter |
|
2005
|
Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata. Zbl 1498.68138
Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas |
|
1997
|
On \(k\)-connectivity problems with sharpened triangle inequality. Zbl 1154.90576
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2008
|
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 0961.68058
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1093.68070
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2004
|
Measures of nondeterminism in finite automata. Zbl 0973.68114
Hromkovič, Juray; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg; Seibert, Sebastian |
|
2000
|
An upper bound for transforming self-verifying automata into deterministic ones. Zbl 1130.68067
Assent, Ira; Seibert, Sebastian |
|
2007
|
On \(k\)-edge-connectivity problems with sharpened triangle inequality. Zbl 1032.68116
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2003
|
Reoptimization of the shortest common superstring problem. (Extended abstract). Zbl 1247.68334
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna |
|
2009
|
On the stability of approximation for Hamiltonian path problems. Zbl 1148.05040
Forlizzi, Luca; Hromkovič, Juraj; Proietti, Guido; Seibert, Sebastian |
|
2006
|
Lower bounds for Las Vegas automata by information theory. Zbl 1084.68061
Hirvensalo, Mika; Seibert, Sebastian |
|
2003
|
Quantifier hierarchies over word relations. Zbl 0783.03025
Seibert, S. |
|
1992
|
The minimal Manhattan network problem in three dimensions. Zbl 1211.68514
Muñoz, Xavier; Seibert, Sebastian; Unger, Walter |
|
2009
|
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1027.68097
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2002
|
The hardness of placing street names in a Manhattan type map. Zbl 1016.68173
Seibert, Sebastian; Unger, Walter |
|
2002
|
Effective strategy constructions for Gale-Stewart-games on transition graphs.
(Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen.) Zbl 0871.90145
Seibert, Sebastian |
|
1996
|
The hardness of placing street names in a Manhattan type map. Zbl 0971.68635
Seibert, Sebastian; Unger, Walter |
|
2000
|
Advice complexity of the online coloring problem. Zbl 1382.68338
Seibert, Sebastian; Sprock, Andreas; Unger, Walter |
|
2013
|
Reoptimization of the shortest common superstring problem. Zbl 1238.68189
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna |
|
2011
|
Reoptimization of the shortest common superstring problem. (Extended abstract). Zbl 1247.68334
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna |
|
2009
|
The minimal Manhattan network problem in three dimensions. Zbl 1211.68514
Muñoz, Xavier; Seibert, Sebastian; Unger, Walter |
|
2009
|
On \(k\)-connectivity problems with sharpened triangle inequality. Zbl 1154.90576
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2008
|
An upper bound for transforming self-verifying automata into deterministic ones. Zbl 1130.68067
Assent, Ira; Seibert, Sebastian |
|
2007
|
On the stability of approximation for Hamiltonian path problems. Zbl 1148.05040
Forlizzi, Luca; Hromkovič, Juraj; Proietti, Guido; Seibert, Sebastian |
|
2006
|
A 1.5-approximation of the minimal Manhattan network problem. Zbl 1173.68869
Seibert, Sebastian; Unger, Walter |
|
2005
|
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1093.68070
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2004
|
On \(k\)-edge-connectivity problems with sharpened triangle inequality. Zbl 1032.68116
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2003
|
Lower bounds for Las Vegas automata by information theory. Zbl 1084.68061
Hirvensalo, Mika; Seibert, Sebastian |
|
2003
|
Communication complexity method for measuring nondeterminism in finite automata. Zbl 1009.68067
Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg |
|
2002
|
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 1094.90036
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2002
|
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1027.68097
Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter |
|
2002
|
The hardness of placing street names in a Manhattan type map. Zbl 1016.68173
Seibert, Sebastian; Unger, Walter |
|
2002
|
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. Zbl 1014.68093
Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas |
|
2001
|
Approximation algorithms for the TSP with sharpened triangle inequality. Zbl 1338.68289
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract). Zbl 1028.90044
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
Improved lower bounds on the approximability of the traveling salesman problem. Zbl 0971.68075
Böckenhauer, Hans-Joachim; Seibert, Sebastian |
|
2000
|
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 0961.68058
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter |
|
2000
|
Measures of nondeterminism in finite automata. Zbl 0973.68114
Hromkovič, Juray; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg; Seibert, Sebastian |
|
2000
|
The hardness of placing street names in a Manhattan type map. Zbl 0971.68635
Seibert, Sebastian; Unger, Walter |
|
2000
|
Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata. Zbl 1498.68138
Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas |
|
1997
|
Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Zbl 0853.68131
Giammarresi, Dora; Restivo, Antonio; Seibert, Sebastian; Thomas, Wolfgang |
|
1996
|
Effective strategy constructions for Gale-Stewart-games on transition graphs.
(Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen.) Zbl 0871.90145
Seibert, Sebastian |
|
1996
|
Nondeterminism versus determinism of finite automata over directed acyclic graphs. Zbl 0803.68032
Potthoff, Andreas; Seibert, Sebastian; Thomas, Wolfgang |
|
1994
|
Quantifier hierarchies over word relations. Zbl 0783.03025
Seibert, S. |
|
1992
|
