Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 139
Volume 139, November 2018
- Oliver Keszöcze
, Mathias Soeken, Rolf Drechsler:
The complexity of error metrics. 1-7 - A. Bijlsma, Harrie J. M. Passier, Harold Pootjes, Sylvia Stuurman:
Template Method test pattern. 8-12 - Toshio Suzuki:
Non-depth-first search against independent distributions on an AND-OR tree. 13-17 - Florian Frohn, Jürgen Giesl:
Constant runtime complexity of term rewriting is semi-decidable. 18-23 - David Gérault, Pascal Lafourcade, Marine Minier, Christine Solnon:
Revisiting AES related-key differential attacks with constraint programming. 24-29 - Pascal Giorgi:
A probabilistic algorithm for verifying polynomial middle product in linear time. 30-34 - Mathias Soeken, Eleonora Testa, Alan Mishchenko, Giovanni De Micheli:
Pairs of majority-decomposing functions. 35-38 - Yossi Azar, Jaya Prakash Champati, Ben Liang:
2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines. 39-43 - Adi Shraibman:
A note on multiparty communication complexity and the Hales-Jewett theorem. 44-48 - Abdullah N. Arslan:
A fast algorithm for all-pairs Hamming distances. 49-52 - Jonathan Stokes, Steven Weber:
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree. 53-59 - Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach:
On some graphs with a unique perfect matching. 60-63 - Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy:
On NC algorithms for problems on bounded rank-width graphs. 64-67
a service of 
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-06-18 21:15 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:
