Article

Free access

Constant time factors do matter

Author:

Neil D. JonesAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 602 - 611

https://doi.org/10.1145/167088.167244

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

Torben Amtoft, Thomas Nikolajsen, Jesper Larsson Tr~ff, Nell D. Jones: Experiments wlth Implementations of two Theoretical Constructions. Logic at Botik, Lecture Notes in Computer Science, Springer-Verlag, vol. 363, pp. 119-133, 1989.

Digital Library

Google Scholar

[2]

H. Barendregt et. al. Term graph rewriting. In J. W. de Bakker, A. J. Nijman, P. C. Treleaven (eds.): PARLE-- Parallel A Rchstectures and Languages Europe (Lecture Notes in Computer Science, vol. 259), 1989.

Digital Library

Google Scholar

[3]

Manuel Blum: A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the Association for Computing Machinery, vol. 14, no. 2, April 1967, pp. 322-336.

Digital Library

Google Scholar

[4]

J. Royer and J. Case: lntensional subrecursion and complexity theory. Research notes in theoretical science. Pitman Press 1988.

Google Scholar

[5]

Yuri Gurevich, Saharon Shelah: Nearly linear time. Logic at Botik, Lecture Notes in Computer Science,Springer- Verlag, vol. 363, pp. 108-118, 1989.

Digital Library

Google Scholar

[6]

J. E. Hopcroft, J. D. Ullman: Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.

Digital Library

Google Scholar

[7]

N.D. Jones, S. Muchnick:Flow analysis and optimization of Lisp-like structures. Program Flow Analysss, eds. N.D. Jones, S. Muchnick, pp. 102-131. Prentice-Hall, New Jersey, 1981.

Google Scholar

[8]

N.D. Jones, P. Sestoft, and H. Scndergaard. Mix: A selfapplicable partial evaluator for experiments in compiler generation. Lssp and Symbolsc Computatson, 2(1):9-50, 1989

Crossref

Google Scholar

[9]

N.D. Jones, C. Gomard, P. Sestoft: Partial Evaluation and Automatic Program Generation. Prentice Hall International, 1993.

Digital Library

Google Scholar

[10]

Stephen Cole Kleene: Introduction to Metamathematics. North-Holland, 1952.

Google Scholar

[11]

Donald Knuth: Fundamental algorithhms. Addison- Wesley, 1968

Google Scholar

[12]

Hartley Rogers: Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.

Digital Library

Google Scholar

[13]

A. SchSnhage: Storage modification machines SIAM Journal of Computing vol. 9, pp. 492-508, 1980.

Google Scholar

[14]

Robert Tarjan: A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences vol. 18, pp. 110-127, 1979.

Crossref

Google Scholar

Cited By

View all

Varanasi SSalazar EMittal NGupta G(2019)Synthesizing Imperative Code from Answer Set Programming SpecificationsLogic-Based Program Synthesis and Transformation10.1007/978-3-030-45260-5_5(75-89)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-45260-5_5
Jones N(2013)A Swiss Pocket Knife for ComputabilityElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.129.1129(1-17)Online publication date: 19-Sep-2013
https://doi.org/10.4204/EPTCS.129.1
Ben-Sasson EChiesa AGenkin DTromer EKleinberg R(2013)Fast reductions from RAMs to delegatable succinct constraint satisfaction problemsProceedings of the 4th conference on Innovations in Theoretical Computer Science10.1145/2422436.2422481(401-414)Online publication date: 9-Jan-2013
https://dl.acm.org/doi/10.1145/2422436.2422481
Show More Cited By

Recommendations

Constant-Time Randomized Parallel String Matching

Given a pattern string of length m for the string-matching problem, we design an algorithm that computes deterministic samples of a sufficiently long substring of the pattern in constant time. This problem used to be the bottleneck in the pattern ...
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures

Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has been little work focusing on improving the constant factors hidden in big-Oh bounds on the ...
Predecessor queries in constant time?
ESA'05: Proceedings of the 13th annual European conference on Algorithms

In this paper we design a new static data structure for batched predecessor queries. In particular, our data structure supports $O(\sqrt{{\rm log}n})$ queries in O(1) time per query and requires $O(n^{\epsilon\sqrt{{\rm log}n}})$ space for any ε > 0. ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
389
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)10

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Varanasi SSalazar EMittal NGupta G(2019)Synthesizing Imperative Code from Answer Set Programming SpecificationsLogic-Based Program Synthesis and Transformation10.1007/978-3-030-45260-5_5(75-89)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-45260-5_5
Jones N(2013)A Swiss Pocket Knife for ComputabilityElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.129.1129(1-17)Online publication date: 19-Sep-2013
https://doi.org/10.4204/EPTCS.129.1
Ben-Sasson EChiesa AGenkin DTromer EKleinberg R(2013)Fast reductions from RAMs to delegatable succinct constraint satisfaction problemsProceedings of the 4th conference on Innovations in Theoretical Computer Science10.1145/2422436.2422481(401-414)Online publication date: 9-Jan-2013
https://dl.acm.org/doi/10.1145/2422436.2422481
Asperti A(2008)The intensional content of Rice's theoremACM SIGPLAN Notices10.1145/1328897.132845543:1(113-119)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328897.1328455
Asperti ANecula GWadler P(2008)The intensional content of Rice's theoremProceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1328438.1328455(113-119)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328438.1328455
Rose E(2005)Linear time hierarchies for a functional language machine modelProgramming Languages and Systems — ESOP '9610.1007/3-540-61055-3_45(311-325)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61055-3_45
Sands DGustavsson JMoran A(2002)Lambda calculi and linear speedupsThe essence of computation10.5555/860256.860261(60-82)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/860256.860261
Sands DGustavsson JMoran A(2002)Lambda Calculi and Linear SpeedupsThe Essence of Computation10.1007/3-540-36377-7_4(60-82)Online publication date: 16-Dec-2002
https://doi.org/10.1007/3-540-36377-7_4
Mogensen T(2000)Linear-Time Self-Interpretation of the Pure Lambda CalculusHigher-Order and Symbolic Computation10.1023/A:101005821361913:3(217-237)Online publication date: 1-Sep-2000
https://dl.acm.org/doi/10.1023/A%3A1010058213619
Mogensen T(2000)Linear Time Self-Interpretation of the Pure Lambda CalculusPerspectives of System Informatics10.1007/3-540-46562-6_11(128-142)Online publication date: 28-Jan-2000
https://doi.org/10.1007/3-540-46562-6_11
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Constant-Time Randomized Parallel String Matching

On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures

Predecessor queries in constant time?