default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 131
Volume 131, March 2018
- Ravi Kishore
, Chiranjeevi Vanarasa, Kannan Srinathan:
On minimal connectivity requirements for secure message transmission in directed networks. 1-6 - Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find trees is NP-complete. 7-14 - Pavel Hrubes, Pavel Pudlák:
A note on monotone real circuits. 15-19 - Byungjin Chung, Changhoon Yim:
Fast intra prediction method by adaptive number of candidate modes for RDO in HEVC. 20-25 - Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent feedback vertex sets for graphs of bounded diameter. 26-32 - Ku-Young Chang, Sun-Mi Park, Dowon Hong, Changho Seo:
Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product. 33-38 - Alan M. Frieze, Samantha Petti:
Balanced allocation through random walk. 39-43 - Pietro Cenciarelli, Daniele Gorla, Ivano Salvo:
Inefficiencies in network models: A graph-theoretic perspective. 44-50 - Xuehou Tan, Bo Jiang:
An improved algorithm for computing a shortest watchman route for lines. 51-54 - Kleitos Papadopoulos, Demetres Christofides:
A fast algorithm for the gas station problem. 55-59
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 2026-05-10 00:30 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:
