default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRicardo Katz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Alfredo Capozucca, Maximiliano Cristiá, Ross Horne, Ricardo Katz:
Brewer-Nash Scrutinised: Mechanised Checking of Policies Featuring Write Revocation. CSF 2024: 112-126- [i8]Alfredo Capozucca
, Maximiliano Cristiá, Ross Horne, Ricardo Katz:
Brewer-Nash Scrutinised: Mechanised Checking of Policies featuring Write Revocation. CoRR abs/2405.12187 (2024) - 2022
- [j13]Maximiliano Cristiá, Ricardo D. Katz, Gianfranco Rossi:
Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra. Comput. J. 65(7): 1891-1903 (2022) - [j12]Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub:
Formalizing the Face Lattice of Polyhedra. Log. Methods Comput. Sci. 18(2) (2022) - [c6]Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, Mateusz Skomra:
Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games. ICALP 2022: 110:1-110:20 - [i7]Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, Mateusz Skomra:
Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games. CoRR abs/2206.09044 (2022) - 2021
- [i6]Maximiliano Cristiá, Ricardo D. Katz, Gianfranco Rossi:
Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra. CoRR abs/2101.07700 (2021) - [i5]Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub:
Formalizing the Face Lattice of Polyhedra. CoRR abs/2104.15021 (2021) - 2020
- [c5]Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub:
Formalizing the Face Lattice of Polyhedra. IJCAR (2) 2020: 185-203
2010 – 2019
- 2019
- [j11]Xavier Allamigeon, Ricardo D. Katz:
A Formalization of Convex Polyhedra Based on the Simplex Method. J. Autom. Reason. 63(2): 323-345 (2019) - 2018
- [j10]Néstor E. Aguilera, Ricardo D. Katz, Paola B. Tolomei:
Addendum to "Vertex adjacencies in the set covering polyhedron" [Discrete Appl. Math. 218(2017) 40-56]. Discret. Appl. Math. 243: 311-315 (2018) - [i4]Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, Mateusz Skomra:
Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming. CoRR abs/1802.07712 (2018) - 2017
- [j9]Néstor E. Aguilera, Ricardo D. Katz, Paola B. Tolomei:
Vertex adjacencies in the set covering polyhedron. Discret. Appl. Math. 218: 40-56 (2017) - [c4]Xavier Allamigeon, Ricardo D. Katz:
A Formalization of Convex Polyhedra Based on the Simplex Method. ITP 2017: 28-45 - [i3]Xavier Allamigeon, Ricardo D. Katz:
A formalization of convex polyhedra based on the simplex method. CoRR abs/1706.10269 (2017) - 2014
- [j8]Xavier Allamigeon, Uli Fahrenberg, Stéphane Gaubert, Ricardo David Katz, Axel Legay:
Tropical Fourier-Motzkin elimination, with an application to real-time verification. Int. J. Algebra Comput. 24(5): 569-608 (2014) - 2013
- [j7]Xavier Allamigeon, Ricardo Katz:
Minimal external representations of tropical polyhedra. J. Comb. Theory A 120(4): 907-940 (2013) - [i2]Xavier Allamigeon, Uli Fahrenberg, Stéphane Gaubert, Ricardo David Katz, Axel Legay:
Tropical Fourier-Motzkin elimination, with an application to real-time verification. CoRR abs/1308.2122 (2013) - 2012
- [j6]Stéphane Gaubert, Ricardo Katz, Sergei Sergeev:
Tropical linear-fractional programming and parametric mean payoff games. J. Symb. Comput. 47(12): 1447-1478 (2012) - 2011
- [j5]Xavier Allamigeon, Stéphane Gaubert, Ricardo Katz:
The number of extreme points of tropical polyhedra. J. Comb. Theory A 118(1): 162-189 (2011) - 2010
- [j4]Michael Di Loreto, Stéphane Gaubert, Ricardo Katz, Jean Jacques Loiseau:
Duality Between Invariant Spaces for Max-Plus Linear Discrete Event Systems. SIAM J. Control. Optim. 48(8): 5606-5628 (2010) - [c3]Stéphane Gaubert, Ricardo Katz, Sergei Sergeev:
Tropical linear programming and parametric mean payoff games. WING@ETAPS/IJCAR 2010: 94-110 - [i1]Xavier Allamigeon, Stéphane Gaubert, Ricardo Katz:
Tropical polar cones, hypergraph transversals, and mean payoff games. CoRR abs/1004.2778 (2010)
2000 – 2009
- 2007
- [j3]Ricardo David Katz:
Max-Plus (A, B)-Invariant Spaces and Control of Timed Discrete-Event Systems. IEEE Trans. Autom. Control. 52(2): 229-241 (2007) - 2006
- [j2]Stephane Gaubert, Ricardo Katz:
Reachability Problems for Products of Matrices in Semirings. Int. J. Algebra Comput. 16(3): 603-627 (2006) - [c2]Stephane Gaubert, Ricardo Katz:
Max-Plus Convex Geometry. RelMiCS 2006: 192-206 - 2004
- [j1]Stéphane Gaubert, Ricardo Katz:
Rational semimodules over the max-plus semiring and geometric approach to discrete event systems. Kybernetika 40(2): 153-180 (2004) - 2003
- [c1]Stephane Gaubert, Ricardo Katz:
Reachability and Invariance Problems in Max-plus Algebra. POSTA 2003: 15-22
Coauthor Index
aka: Stephane Gaubert
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-10-07 21:15 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:
