Article

Free access

Look ma, no hashing, and no arrays neither

Authors:

Jiazhen Cai,

Robert A. PaigeAuthors Info & Claims

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 143 - 154

https://doi.org/10.1145/99583.99605

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

Aho, A., Hopcroft, J., and Ullman, J., Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

Digital Library

Google Scholar

[2]

Aho, A., Sethi, R. and UIIman, J., Compilers, Addison- Wesley, 1986.

Google Scholar

[3]

Allen, F. E., Cocke, J., and Kennedy, K., "Reduction of Operator Strength," in Program Flow Analysis, ed. Muchnick, S. and Jones, N., pp. 79-101, Prentice Hall, 1981.

Google Scholar

[4]

Alpern, B., Wegman, N., and Zadeck, K., "Detecting Equality of Variables in Programs," in Proc. 15th ACM POPL, Jan, 1988.

Digital Library

Google Scholar

[5]

Carter, J. and Wegman, M., "Universal Classes of Hash Functions," JCSS, vol. 18, no. 2, pp. 143-154, 1979.

Crossref

Google Scholar

[6]

Cocke, J. and Kennedy, K., "An Algorithm for Reduction of Operator Strength," CACM, vol. 20, no. 11, pp. 850-856, Nov., 1977.

Digital Library

Google Scholar

[7]

Cocke, J. and Schwartz, J. T., Programming Languages and Their Compilers, Lecture Notes, C/MS, New York University, 1969.

Digital Library

Google Scholar

[8]

Cytron, R., Lowry, A., and Zadeck, K., "Code Motion of Control Structures in High-leveI Languages," IBM Research Center/Yorktown Heights, 1985.

Google Scholar

[9]

Downey, P., Set.hi, R., and Tarjan, R., "Variations on the Common Subexpression Problem," JACM, vol. 27, no. 4, pp. 758-771, Oct., 1980.

Digital Library

Google Scholar

[10]

Hoffmann, C. and O'Dormell, J., "Pattern Matching in Trees," JACM, vol. 29, no. 1, pp. 68-95, Jan, 1982.

Digital Library

Google Scholar

[11]

Hopcroft, J., "An n log n Algorithm for Minimizing States in a Finite Automaton," in Theory of Machines and Computations, ed. Kohavi and Paz, pp. 189-196, Academic Press, New York, 1971.

Google Scholar

[12]

Lewis, F., Rosencrantz, D., and Steams, R., Compiler Design Theory, Addison-Wesley, 1976.

Digital Library

Google Scholar

[13]

Mairson, H., "The Program Complexity of Searching a Table," in 24th IEEE FOCS, pp. 40-47, Nov., 1983.

Google Scholar

[14]

Paige, R., "Symbolic Finite Differencing- Part i," in Proc. ESOP 90, ed. N. Jones, Lecture Notes in Computer Science, vol. 432, Springer-Verlag, 1990.

Digital Library

Google Scholar

[15]

Paige, R., "Real-time Simulation of a Set Machine on a RAM," in ICCI '89, ed. W. Koczkodaj, Computing and Information, Vol II, pp. 69-73, 1989.

Google Scholar

[16]

Paige, R and Tarjart, R., "Three Efficient Algorithms Based on Partition Refinement," SIAM Journal on Computing, vol. 16, no. 6, Dec., 1987.

Digital Library

Google Scholar

[17]

Paige, R., Tarjan, R., and Bonic, R., "A Linear Time Solution to the Single Function Coarsest Partition Problem," TCS, vol. 40, no. 1, pp. 67-84, Sep, 1985.

Crossref

Google Scholar

[18]

Pelegri-Llopart, E., Rewrite Systems, Pattern Matching, and Code Generation, U. of CA - Berkeley, 1987. Ph.D. Dissertation

Digital Library

Google Scholar

[19]

Stearns, R., "Deterministic top-down parsing," in Proc. 5th Princeton Conf. on Information Sciences and Systerns, pp. 182-188, 1971.

Google Scholar

[20]

Tarjan, R., "Depth first search and linear graph algorithms," SlAM J. Comput, vol. 1, no. 2, pp. 146-160, 1972.

Crossref

Google Scholar

[21]

Warshall, S., "A Theorem on Boolean matrices," JACM, vol. 9, no. 1, pp. 11-12, 1962.

Digital Library

Google Scholar

[22]

Wegman, M. N. and Zadeck, F. K., "Constant Propagation with Conditional Branches," in Proc. 12th ACM POPL, Jan, 1985.

Digital Library

Google Scholar

[23]

Yang, W., Horwitz, S., and Reps, T., "Detecting program components with equivalent behaviors," TR-840, Computer Sciences Dept., Univ. of Wisconsin, Madison, WI, April 1989.

Google Scholar

[24]

Yang, W., "A new algorithm for semantics-based program integration," Ph.D. Dissertation, TR 962, Computer Sciences Dept., Univ. of Wisconsin, Madison, WI, August 1990.

Digital Library

Google Scholar

Cited By

View all

Hawkins PAiken AFisher KRinard MSagiv MHall MPadua D(2011)Data representation synthesisProceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1993498.1993504(38-49)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993498.1993504
Hawkins PAiken AFisher KRinard MSagiv M(2011)Data representation synthesisACM SIGPLAN Notices10.1145/1993316.199350446:6(38-49)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993316.1993504
Hawkins PAiken AFisher KRinard MSagiv M(2010)Data structure fusionProceedings of the 8th Asian conference on Programming languages and systems10.5555/1947873.1947893(204-221)Online publication date: 28-Nov-2010
https://dl.acm.org/doi/10.5555/1947873.1947893
Show More Cited By

Index Terms

Look ma, no hashing, and no arrays neither
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
2. Software and its engineering
  1. Software notations and tools

Recommendations

A search-free DOA estimation algorithm for coprime arrays

Recently, coprime arrays have been in the focus of research because of their potential in exploiting redundancy in spanning large apertures with fewer elements than suggested by theory. A coprime array consists of two uniform linear subarrays with inter-...
Biclique Cryptanalysis of Full Round AES-128 Based Hashing Modes
Inscrypt 2015: Revised Selected Papers of the 11th International Conference on Information Security and Cryptology - Volume 9589

In this work, we revisit the security analysis of hashing modes instantiated with AES-128. We use biclique cryptanalysis as the basis for our evaluation. In Asiacrypt'11, Bogdanov et al. had proposed biclique technique for key recovery attacks on full ...
Super nested arrays: Sparse arrays with less mutual coupling than nested arrays
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
In array processing, mutual coupling between sensors has an adverse effect on the estimation of parameters (e.g., DOA). Sparse arrays, such as nested arrays, coprime arrays, and minimum redundancy arrays (MRAs), have reduced mutual coupling compared to ...

Comments

Information & Contributors

Information

Published In

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1991

366 pages

ISBN:0897914198

DOI:10.1145/99583

Chairman:
David Wise
Indiana Univ., Bloomington

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: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL91

Sponsor:

POPL91: 18th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

January 21 - 23, 1991

Florida, Orlando, USA

Acceptance Rates

POPL '91 Paper Acceptance Rate 31 of 152 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
746
Total Downloads

Downloads (Last 12 months)80
Downloads (Last 6 weeks)12

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hawkins PAiken AFisher KRinard MSagiv MHall MPadua D(2011)Data representation synthesisProceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1993498.1993504(38-49)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993498.1993504
Hawkins PAiken AFisher KRinard MSagiv M(2011)Data representation synthesisACM SIGPLAN Notices10.1145/1993316.199350446:6(38-49)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993316.1993504
Hawkins PAiken AFisher KRinard MSagiv M(2010)Data structure fusionProceedings of the 8th Asian conference on Programming languages and systems10.5555/1947873.1947893(204-221)Online publication date: 28-Nov-2010
https://dl.acm.org/doi/10.5555/1947873.1947893
Henglein FGallagher JVoigtländer J(2010)Optimizing relational algebra operations using generic equivalence discriminators and lazy productsProceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1706356.1706372(73-82)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1706356.1706372
Hawkins PAiken AFisher KRinard MSagiv M(2010)Data Structure FusionProgramming Languages and Systems10.1007/978-3-642-17164-2_15(204-221)Online publication date: 2010
https://doi.org/10.1007/978-3-642-17164-2_15
Henglein FHook JThiemann P(2008)Generic discriminationProceedings of the 13th ACM SIGPLAN international conference on Functional programming10.1145/1411204.1411220(91-102)Online publication date: 20-Sep-2008
https://dl.acm.org/doi/10.1145/1411204.1411220
Krauss A(2008)Pattern minimization problems over recursive data typesACM SIGPLAN Notices10.1145/1411203.141124243:9(267-274)Online publication date: 20-Sep-2008
https://dl.acm.org/doi/10.1145/1411203.1411242
Hinze R(2008)Functional pearlACM SIGPLAN Notices10.1145/1411203.141123243:9(189-200)Online publication date: 20-Sep-2008
https://dl.acm.org/doi/10.1145/1411203.1411232
Adams MDybvig R(2008)Efficient nondestructive equality checking for trees and graphsACM SIGPLAN Notices10.1145/1411203.141123043:9(179-188)Online publication date: 20-Sep-2008
https://dl.acm.org/doi/10.1145/1411203.1411230
Henglein F(2008)Generic discriminationACM SIGPLAN Notices10.1145/1411203.141122043:9(91-102)Online publication date: 20-Sep-2008
https://dl.acm.org/doi/10.1145/1411203.1411220
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A search-free DOA estimation algorithm for coprime arrays

Biclique Cryptanalysis of Full Round AES-128 Based Hashing Modes

Super nested arrays: Sparse arrays with less mutual coupling than nested arrays