Skip to main content
padlock icon - secure page this page is secure

Publisher: Springer Science and Media

Volume 37, Number 2, 2000

Computational complexity via programming languages: constant factors do matter
pp. 83-120(38)
Authors: Ben-Amram, A. M.; Jones, N. D.

Favourites:
ADD

Efficiently building a parse tree from a regular expression
pp. 121-144(24)
Authors: Dube, D.; Feeley, M.

Favourites:
ADD

Some results on the Collatz problem
pp. 145-159(15)
Authors: Andrei, S.; Kudlek, M.; Niculescu, R. S.

Favourites:
ADD

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more