default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 125
Volume 125, September 2017
- Kensuke Baba
:
An acceleration of FFT-based algorithms for the match-count problem. 1-4 - Lukás Folwarczný, Dusan Knop:
IV-matching is strongly NP-hard. 5-8 - Martijn van Ee:
Some notes on bounded starwidth graphs. 9-14 - Joe Sawada, Patrick Hartman:
Finding the largest fixed-density necklace and Lyndon word. 15-19 - Andreas Björklund, Thore Husfeldt, Isak Lyckberg:
Computing the permanent modulo a prime power. 20-25 - Dmitry Kosolobov:
Tight lower bounds for the longest common extension problem. 26-29 - Weihua Yang, Shuli Zhao, Shurong Zhang:
Strong Menger connectivity with conditional faults of folded hypercubes. 30-34 - Ting Yu, Mengchi Liu:
A linear time algorithm for maximal clique enumeration in large sparse graphs. 35-40 - Weiguang Peng, NingNing Peng, Keng Meng Ng, Kazuyuki Tanaka, Yue Yang:
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. 41-45
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-10-30 20:20 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:
