default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 143
Volume 143, March 2019
- Patrick K. Nicholson
:
Revisiting explicit adaptive two-probe schemes. 1-3 - Amanda Clare, Jacqueline W. Daykin:
Enhanced string factoring from alphabet orderings. 4-7 - Stéphane Le Roux:
Memoryless determinacy of infinite parity games: Another simple proof. 8-13 - Maxime Meyer, Ben Smyth:
Exploiting re-voting in the Helios election system. 14-19 - Yuan Yuan, Rong-Xia Hao:
A degree condition for fractional [a, b]-covered graphs. 20-23 - Iago A. Carvalho:
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions. 24-27 - Alexandros A. Voudouris:
A note on the efficiency of position mechanisms with budget constraints. 28-33 - Daniël Paulusma, Stefan Szeider:
On the parameterized complexity of (k, s)-SAT. 34-36 - Sven C. Polak, Alexander Schrijver:
New lower bound on the Shannon capacity of C7 from circular graphs. 37-40 - Unjong Yu, Jeong-Ok Choi:
A note on general epidemic region for infinite regular graphs. 41-46 - Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solís-Villarreal, Jorge Urrutia:
Minimizing the solid angle sum of orthogonal polyhedra. 47-50 - Ramin Mousavi:
Thin trees in 8-edge-connected planar graphs. 51-55 - Hiroaki Yamamoto:
A faster algorithm for finding shortest substring matches of a regular expression. 56-60 - Enes Pasalic, Sugata Gangopadhyay, Wei-Guo Zhang, Samed Bajric:
Design methods for semi-bent functions. 61-70
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 2024-11-21 20:30 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:
