


default search action
Information Processing Letters, Volume 137
Volume 137, September 2018
- Andrea Visconti  , Chiara Valentina Schiavo, René Peralta: , 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ý , Bernard Lidický , Tomás Masarík , Tomás Masarík , Florian Pfender , 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 , Hubert Msuya , Suzan Kessy, Michael Kisangiri: , 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 , Sudarson Jena : :
 Exchanged folded crossed cube: A new interconnection network for parallel computation. 40-46
- Patrizio Angelini  , Giordano Da Lozzo , 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: , Jeno Lehel:
 Linkage on the infinite grid. 51-56
- Golnaz Badkobeh, Gabriele Fici  , Simon J. Puglisi , 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.


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID














