default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News (ACM), Volume 17
Volume 17, Number 1, June 1985
- Nicola Santoro:
The un-merging problem. 5-6 - John V. Franco:
Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions. 40-59 - Gilles Brassard:
Crusade for a better notation. 60-64 - Rod McBeth:
The tree structure of exponential calculations. 65-77 - Csaba J. Egyhazy, T. B. Ramsay:
Generating a set of fundamental cycles in a graph. 78-82
Volume 17, Number 2, September 1985
- Harold M. Hastings:
Maps of the interval, polynomial time, and polynomial space. 44-51 - Harold M. Hastings:
Convergence of simulated annealing-hastings. 52-63
Volume 17, Number 3, Winter 1986
- Charles B. Dunham:
A simpler approach to the busy beaver problem. 29 - Mara Chibnik:
Algorithmic elimination of spurious nondeterminism from Mealy machines. 30-34 - Robert M. Nirenberg:
A practical turing machine representation. 35-44
Volume 17, Number 4, Spring 1986
- Mark N. Wegman:
What it's like to be a POPL referee. 50-51 - Zvi Galil, Raffaele Giancarlo:
Improved string matching with k mismatches. 52-54 - Leona F. Fass:
On the inference of canonical context-free grammars. 55-60 - Yuri Gurevich:
What does O(n) mean. 61-63
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 2025-12-05 22:23 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:
