default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph Bottesch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Ralph Bottesch, Jose Divasón, René Thiemann:
Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation. Arch. Formal Proofs 2021 (2021)- 2020
- [j3]René Thiemann
, Ralph Bottesch, Jose Divasón, Max W. Haslbeck, Sebastiaan J. C. Joosten, Akihisa Yamada:
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL. J. Autom. Reason. 64(5): 827-856 (2020) - [c8]Ralph Bottesch, Max W. Haslbeck, Alban Reynaud, René Thiemann:
Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL. NFM 2020: 233-250
2010 – 2019
- 2019
- [j2]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Farkas' Lemma and Motzkin's Transposition Theorem. Arch. Formal Proofs 2019 (2019) - [j1]Ralph Bottesch, Alban Reynaud, René Thiemann:
Linear Inequalities. Arch. Formal Proofs 2019 (2019) - [c7]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL. FroCos 2019: 223-239 - [c6]Jouke Witteveen, Ralph Bottesch, Leen Torenvliet:
A Hierarchy of Polynomial Kernels. SOFSEM 2019: 504-518 - [i5]Jouke Witteveen, Ralph Bottesch, Leen Torenvliet:
A Hierarchy of Polynomial Kernels. CoRR abs/1902.11006 (2019) - 2018
- [c5]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. LPAR 2018: 164-180 - [c4]Ralph Christian Bottesch:
On W[1]-Hardness as Evidence for Intractability. MFCS 2018: 73:1-73:15 - 2017
- [c3]Ralph Bottesch:
Relativization and Interactive Proof Systems in Parameterized Complexity Theory. IPEC 2017: 9:1-9:12 - [i4]Ralph Christian Bottesch:
Relativization and Interactive Proof Systems in Parameterized Complexity Theory. CoRR abs/1706.09391 (2017) - [i3]Ralph C. Bottesch:
On W[1]-Hardness as Evidence for Intractability. CoRR abs/1712.05766 (2017) - 2015
- [c2]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Correlation in Hard Distributions in Communication Complexity. APPROX-RANDOM 2015: 544-572 - [c1]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Equality, Revisited. MFCS (2) 2015: 127-138 - [i2]Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Correlation in Hard Distributions in Communication Complexity. CoRR abs/1508.05189 (2015) - [i1]Ralph C. Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Equality, Revisited. CoRR abs/1511.01211 (2015)
Coauthor Index
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
