![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Gunther Reissig
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j10]Elisei Macoveiciuc
, Gunther Reissig
:
On-the-Fly Symbolic Synthesis With Memory Reduction Guarantees. IEEE Trans. Autom. Control. 68(4): 2576-2583 (2023) - 2022
- [j9]Mohamed Serry
, Gunther Reissig
:
Overapproximating Reachable Tubes of Linear Time-Varying Systems. IEEE Trans. Autom. Control. 67(1): 443-450 (2022) - [c24]Alexander Weber
, Elisei Macoveiciuc, Gunther Reissig:
ABS: A formally correct software tool for space-efficient symbolic synthesis. HSCC 2022: 19:1-19:10 - 2021
- [i8]Mohamed Serry, Gunther Reissig:
Over-approximating reachable tubes of linear time-varying systems. CoRR abs/2102.04971 (2021)
2010 – 2019
- 2019
- [j8]Gunther Reissig
, Matthias Rungger
:
Symbolic Optimal Control. IEEE Trans. Autom. Control. 64(6): 2224-2239 (2019) - [c23]Elisei Macoveiciuc, Gunther Reissig:
Memory efficient symbolic solution of quantitative reach-avoid problems. ACC 2019: 1671-1677 - 2018
- [c22]Mohamed Serry, Gunther Reissig:
Hyper-Rectangular Over-Approximations of Reachable Sets for Linear Uncertain Systems. CDC 2018: 6275-6282 - 2017
- [j7]Gunther Reissig, Alexander Weber
, Matthias Rungger:
Feedback Refinement Relations for the Synthesis of Symbolic Controllers. IEEE Trans. Autom. Control. 62(4): 1781-1796 (2017) - [j6]Alexander Weber
, Matthias Rungger
, Gunther Reissig
:
Optimized State Space Grids for Abstractions. IEEE Trans. Autom. Control. 62(11): 5816-5821 (2017) - [c21]Matthias Rungger, Gunther Reissig:
Arbitrarily precise abstractions for optimal controller synthesis. CDC 2017: 1761-1768 - [i7]Gunther Reissig, Matthias Rungger:
Symbolic Optimal Control. CoRR abs/1709.07333 (2017) - [i6]Alexander Weber, Matthias Rungger, Gunther Reissig:
Optimized State Space Grids for Abstractions. CoRR abs/1711.01637 (2017) - 2016
- [c20]Gunther Reissig:
Approximate value iteration for a class of deterministic optimal control problems with infinite state and input alphabets. CDC 2016: 1063-1068 - [c19]Matthias Rungger, Gunther Reissig, Majid Zamani
:
Symbolic synthesis with average performance guarantees. CDC 2016: 7404-7410 - 2015
- [c18]Matthias Rungger, Alexander Weber
, Gunther Reissig:
State space grids for low complexity abstractions. CDC 2015: 6139-6146 - [i5]Gunther Reissig, Alexander Weber, Matthias Rungger:
Feedback Refinement Relations for the Synthesis of Symbolic Controllers. CoRR abs/1503.03715 (2015) - 2014
- [j5]Alexander Weber
, Gunther Reissig:
Classical and Strong Convexity of Sublevel Sets and Application to Attainable Sets of Nonlinear Systems. SIAM J. Control. Optim. 52(5): 2857-2876 (2014) - [j4]Gunther Reissig, Christoph Hartung, Ferdinand Svaricek:
Strong Structural Controllability and Observability of Linear Time-Varying Systems. IEEE Trans. Autom. Control. 59(11): 3087-3092 (2014) - [c17]Gunther Reissig, Matthias Rungger:
Feedback refinement relations for symbolic controller synthesis. CDC 2014: 88-94 - [c16]Alexander Weber
, Gunther Reissig, Ferdinand Svaricek:
A linear time algorithm to verify strong structural controllability. CDC 2014: 5574-5580 - 2013
- [c15]Christoph Hartung, Gunther Reissig, Ferdinand Svaricek:
Sufficient conditions for strong structural controllability of uncertain linear time-varying systems. ACC 2013: 5875-5880 - [c14]Alexander Weber
, Gunther Reissig:
Strongly convex attainable sets and low complexity finite-state controllers. AuCC 2013: 61-66 - [c13]Christoph Hartung, Gunther Reissig, Ferdinand Svaricek:
Characterization of sign controllability for linear systems with real eigenvalues. AuCC 2013: 450-455 - [c12]Gunther Reissig, Matthias Rungger:
Abstraction-based solution of optimal stopping problems under uncertainty. CDC 2013: 3190-3196 - [c11]Christoph Hartung, Gunther Reissig, Ferdinand Svaricek:
Necessary conditions for structural and strong structural controllability of linear time-varying systems. ECC 2013: 1335-1340 - [i4]Gunther Reißig:
On the maximum rank of Toeplitz block matrices of blocks of a given pattern. CoRR abs/1305.4277 (2013) - [i3]Gunther Reissig, Christoph Hartung, Ferdinand Svaricek:
Strong Structural Controllability of Linear Time-Varying Systems. CoRR abs/1306.1486 (2013) - 2012
- [c10]Christoph Hartung, Gunther Reissig, Ferdinand Svaricek:
Characterization of strong structural controllability of uncertain linear time-varying discrete-time systems. CDC 2012: 2189-2194 - [i2]Gunther Reißig:
Convexity of reachable sets of nonlinear ordinary differential equations. CoRR abs/1211.6080 (2012) - 2011
- [j3]Gunther Reissig:
Computing Abstractions of Nonlinear Systems. IEEE Trans. Autom. Control. 56(11): 2583-2598 (2011) - [c9]Hao Ding, Gunther Reissig, Dominic Gross
, Olaf Stursberg
:
Mixed-integer programming for optimal path planning of robotic manipulators. CASE 2011: 133-138 - [c8]Hao Ding, Gunther Reissig, Olaf Stursberg
:
Increasing efficiency of optimization-based path planning for robotic manipulators. CDC/ECC 2011: 1399-1404 - [c7]Hao Ding, Kurniawan Wijaya, Gunther Reißig, Olaf Stursberg
:
Optimizing Motion of Robotic Manipulators in Interaction with Human Operators. ICIRA (1) 2011: 520-531 - [c6]Hao Ding, Gunther Reissig, Kurniawan Wijaya, Dino Bortot, Klaus Bengler, Olaf Stursberg
:
Human arm motion modeling and long-term prediction for safe and efficient Human-Robot-Interaction. ICRA 2011: 5875-5880 - 2010
- [c5]Gunther Reissig:
Abstraction based solution of complex attainability problems for decomposable continuous plants. CDC 2010: 5911-5917 - [c4]Jingge Zhu
, Slawomir Stanczak, Gunther Reißig:
Stabilization of linear dynamical systems with scalar quantizers under communication constraints. CISS 2010: 1-6
2000 – 2009
- 2009
- [c3]Gunther Reißig:
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems. HSCC 2009: 306-320 - [i1]Gunther Reißig:
Computing abstractions of nonlinear systems. CoRR abs/0910.2187 (2009) - 2002
- [c2]Gunther Reißig, Holger Boche, Paul I. Barton:
On inconsistent initial conditions for linear time-invariant differential-algebraic equations. ISCAS (3) 2002: 507-510 - 2001
- [c1]Gunther Reissig:
On methods for ordering sparse matrices in circuit simulation. ISCAS (5) 2001: 315-318 - 2000
- [j2]Gunther Reissig, Wade S. Martinson, Paul I. Barton:
Differential-Algebraic Equations of Index 1 May Have an Arbitrarily High Structural Index. SIAM J. Sci. Comput. 21(6): 1987-1990 (2000)
1990 – 1999
- 1999
- [j1]Gunther Reißig:
Extension of the normal tree method. Int. J. Circuit Theory Appl. 27(2): 241-265 (1999)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint