default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 137
Volume 137, September 2018
- Andrea Visconti
, Chiara Valentina Schiavo, René Peralta:
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). 1-5 - Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. 6-10 - Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. 11-16 - Rob J. van Glabbeek:
On the validity of encodings of the synchronous in the asynchronous π-calculus. 17-25 - Baraka Jacob Maiseli, Hubert Msuya, Suzan Kessy, Michael Kisangiri:
Perona-Malik model with self-adjusting shape-defining constant. 26-32 - Massimo Lauria:
A note about k-DNF resolution. 33-39 - K. Bhavani, Sudarson Jena:
Exchanged folded crossed cube: A new interconnection network for parallel computation. 40-46 - Patrizio Angelini, Giordano Da Lozzo:
3-coloring arrangements of line segments with 4 slopes is hard. 47-50 - Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Linkage on the infinite grid. 51-56 - Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi:
Algorithms for anti-powers in strings. 57-60
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.
last updated on 2025-01-13 01:06 CET 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:
