Остановите войну!
for scientists:
default search action
Bruno Codenotti
- > Home > Persons > Bruno Codenotti
Publications
- 2006
- [c28]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. ESA 2006: 232-243 - [i5]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2003
- [j22]Bruno Codenotti, Ivan Gerace, Giovanni Resta:
Some remarks on the Shannon capacity of odd cycles. Ars Comb. 66 (2003) - [c19]Andrea Bonaccorsi, Bruno Codenotti, Nicola Dimitri, Mauro Leoncini, Giovanni Resta, Paolo Santi:
Generating Realistic Data Sets for Combinatorial Auctions. CEC 2003: 331-338 - 2000
- [j18]Bruno Codenotti, Pavel Pudlák, Giovanni Resta:
Some structural properties of low-rank matrices related to computational complexity. Theor. Comput. Sci. 235(1): 89-107 (2000) - 1997
- [c15]Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta:
Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207 - [c12]Bruno Codenotti, G. Mariotti, S. Pedinotti, Giovanni Resta:
Parallel Implementation of a Discontinuous Finite Element Method for the Solution of the Navier-Stokes Equations. Parallel CFD 1997: 257-261 - [c11]Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta:
Computing Groebner Bases in the Boolean Setting with Applications to Counting. WAE 1997: 209-218 - [i1]Bruno Codenotti, Pavel Pudlák, Giovanni Resta:
Some structural properties of low rank matrices related to computational complexity. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j14]Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta:
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP. INFORMS J. Comput. 8(2): 125-133 (1996) - [j13]Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165(2): 483-490 (1996) - 1994
- [j11]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra. Theor. Comput. Sci. 127(1): 99-121 (1994) - 1993
- [c5]Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta:
Global Strategies for Augmenting the Efficiency of TSP Heuristics. WADS 1993: 253-264 - 1992
- [c4]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Repeated Matrix Squaring for the Parallel Solution of Linear Systems. PARLE 1992: 725-732
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-01-09 23:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint