Sebastian Seibert

From MaRDI portal
Revision as of 22:38, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:208755

Available identifiers

zbMath Open seibert.sebastianMaRDI QIDQ208755

List of research outcomes

PublicationDate of PublicationType
Translating regular expressions into small ε-free nondeterministic finite automata2022-11-09Paper
Bounds for approximating MaxLinEq3-2 and MaxEkSat2018-07-03Paper
Approximation algorithms for the TSP with sharpened triangle inequality2016-06-16Paper
Advice Complexity of the Online Coloring Problem2013-06-07Paper
Reoptimization of the shortest common superstring problem2011-09-20Paper
Reoptimization of the Shortest Common Superstring Problem2009-07-07Paper
The Minimal Manhattan Network Problem in Three Dimensions2009-02-24Paper
On \(k\)-connectivity problems with sharpened triangle inequality2009-02-23Paper
An upper bound for transforming self-verifying automata into deterministic ones2007-11-14Paper
https://portal.mardi4nfdi.de/entity/Q34153532007-01-18Paper
Algorithms and Computation2006-11-14Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality2005-01-11Paper
Lower Bounds for Las Vegas Automata by Information Theory2004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q45015482004-01-27Paper
https://portal.mardi4nfdi.de/entity/Q44375082003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44152442003-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44120972003-07-13Paper
Communication complexity method for measuring nondeterminism in finite automata2003-01-14Paper
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.2002-08-05Paper
The hardness of placing street names in a Manhattan type map2002-08-05Paper
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata2002-07-02Paper
https://portal.mardi4nfdi.de/entity/Q27541442001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27288932001-11-06Paper
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem2001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45039382001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49426152000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q43392261997-06-06Paper
Monadic second-order logic over rectangular pictures and recognizability by tiling systems1996-07-03Paper
Nondeterminism versus determinism of finite automata over directed acyclic graphs1994-06-15Paper
https://portal.mardi4nfdi.de/entity/Q42029551993-09-06Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sebastian Seibert