Map
Index
Random
Help
Quotes
Related
th

ThesaHelp: ACM references f-l

topic root > Group: all references


--related--
all references
ACM references
ACM references a-e
ACM references f-l
ACM references m-z

--referenced--
all Thesa topics

Summary

ACM references from 'f' to 'l' by first author
Quotes: up

QuoteRef: fagiR9_1979 ;;Fagin, R. et al., Extendible hashing--a fast access method for dynamic files
QuoteRef: fahnM11_2003 ;;Fahndrich, M., Leino, K.R.M., Declaring and checking non-null types in an object-oriented language
QuoteRef: falkAD8_1978 ;;Falkoff, A.D., The evolution of APL
QuoteRef: faloC7_1987 ;;Faloutsos, C., Christodoulakis, S., Description and performance analysis of signature file methods for office filing
QuoteRef: farbDJ1_1964 ;;Farber, D.J. et al., SNOBOL, a string manipulation language
QuoteRef: farcE6_2005 ;;Farcas, E. et al., Transparent distribution of real-time components based on logical execution time
QuoteRef: faroS2_2013 ;;Faro, S., Lecroq, T., The exact online string matching problem: a review of the most recent results
QuoteRef: faroS5_2020 ;;Farooqi, S. et al., Measuring and mitigating OAuth access token abuse by collusion networks [NewQuotes]
QuoteRef: faulSR3_1988 ;;Faulk, S.R., Parnas, D.L., On synchronization in hard-real-time systems
QuoteRef: fedaA3_1997 ;;Fedanzo, A., Distributed systems registry [Letter to the editor]
QuoteRef: fehrE4_1983 ;;Fehr, E., The "Simplest Functional Programming Language" is neither simple nor functional
QuoteRef: feiS7_2021 ;;Fei, S. et al., Security vulnerabilities of SGX and countermeasures: a survey [NewQuotes]
QuoteRef: feigEA5_1996 ;;Feigenbaum, E.A., How the "what" becomes the "how"
QuoteRef: feinS1_1982 ;;Feiner, S. et al., An experimental system for creating and presenting interactive graphical documents
QuoteRef: feinS3_1988 ;;Feiner, S., Seeing the forest for the trees: hierarchical display of hypertext structure
QuoteRef: feitAM2_2021 ;;Feit, A.M. et al., AZERTY ameliore: Computational design on a national scale [NewQuotes]
QuoteRef: fekeJD5_1999 ;;Fekete, J.-D., Plaisant, C., Excentric labeling: dynamic neighborhood labeling for data visualization
QuoteRef: feldJ2_1968 ;;Feldman, J., Gries, D., Translator writing systems
QuoteRef: feldJA8_1969 ;;Feldman, J.A., Rovner, P.D., An Algol-based associative language
QuoteRef: feldM7_2020 ;;Feldmann, M. et al., Survey on algorithms for self-stabilizing overlay networks [NewQuotes]
QuoteRef: fellM3_2018 ;;Felleisen, M. et al., A programmable programming language
QuoteRef: fengM2_2011 ;;Feng, M. et al., SpiceC: Scalable parallelism via implicit copying and explicit commit
QuoteRef: fensW10_2017 ;;Fenske, W., How preprocessor annotations (do not) affect maintainability: a case study on change-proneness
QuoteRef: ferrJ7_1987 ;;Ferrante, J. et al., The program dependence graph and its use in optimization
QuoteRef: ferrP1_1995 ;;Ferragina, P., Grossi, R., Fast incremental text editing
QuoteRef: fialER4_1989 ;;Fiala, E.R., Greene, D.H., Data compression with finite windows
QuoteRef: fielRT5_2002 ;;Fielding, R.T., Taylor, R.N., Principled design of the modern web architecture
QuoteRef: fiscG5_1989 ;;Fischer, G. et al., Design environments for constructive and argumentative design
QuoteRef: fishJA10_1992 ;;Fisher, J.A., Freudenberger, S.M., Predicting conditional branch directions from previous runs of a program [NewQuotes]
QuoteRef: fishK6_2005 ;;Fisher, K., Gruber, R., PADS: a domain-specific language for processing ad hoc data
QuoteRef: fishK1_2008 ;;Fisher, K. et al., From dirt to shovels. Fully automatic tool generation from ad hoc data
QuoteRef: fishRS3_1988 ;;Fish, R.S. et al., Quilt: a collaborative tool for cooperative writing
QuoteRef: flanC6_2000 ;;Flanagan, C., Freund, S.N., Type-based race detection for Java
QuoteRef: flanC6_2002 ;;Flanagan, C. et al., Extended static checking for Java
QuoteRef: flanC6_2003 ;;Flanagan, C., Qadeer, S., A type and effect system for atomicity
QuoteRef: flanC6_2009 ;;Flanagan, C., Freund, S.N., FastTrack: efficient and precise dynamic race detection
QuoteRef: flanC6_2010 ;;Flanagan, C., Freund, S.N., Adversarial memory for detecting destructive races
QuoteRef: flatM6_2004 ;;Flatt, M., Findler, R.B., Kill-safe synchronization abstractions
QuoteRef: flatM1_2016 ;;Flatt, M., Binding as sets of scopes
QuoteRef: florD11_2016 ;;Florencio, D. et al., Pushing the string: the 'don't care' region of password strength
QuoteRef: floyRW2_1964 ;;Floyd, R.W., Bounded context syntactic analysis [NewQuotes]
QuoteRef: floyRW8_1979 ;;Floyd, R.W., The paradigms of programming
QuoteRef: flurS1_2017 ;;Flur, S. et al., Mixed-size concurrency: ARM, POWER, C/C++11, and SC
QuoteRef: fordB7_1978 ;;Ford, B., Parameterization of the environment for transportable numerical software
QuoteRef: fostJM6_1977 ;;Foster, J.M., Foster, P.D., Abstract data and functors
QuoteRef: fostJN1_2005 ;;Foster, J.N. et al., Combinators for bi-directional tree transformations
QuoteRef: fostN9_2011 ;;Foster, N. et al., Frenetic: A network programming language
QuoteRef: fousG10_2015 ;;Foust, G. et al., Generating reactive programs for graphical user interfaces with multi-way dataflow constraint system
QuoteRef: foxEA7_1991 ;;Fox, E.A. et al., Order-preserving minimal perfect hash functions and information retrieval
QuoteRef: franM12_1997 ;;Franz, M., Kistler, T., Slim Binaries
QuoteRef: franMJ9_1997 ;;Franklin, M.J. et al., Transactional client-server cache consistency: alternatives and performance
QuoteRef: franN8_1977 ;;Francez, N., Another advantage of keyword notation for parameter communication with subprograms
QuoteRef: franRS4_1983 ;;Francis, R.S., Containment defines a class of recursive data structures
QuoteRef: frasAG6_1971 ;;Fraser, A.G., On the meaning of names in programming systems
QuoteRef: frasCW3_1980 ;;Fraser, C.W., A generalized text editor
QuoteRef: frasCW6_1983 ;;Fraser, C.W., Hanson, D.R., A high-level programming and command language
QuoteRef: frasCW6_1984 ;;Fraser, C.W. et al., Analyzing and compressing assembly code
QuoteRef: frasCW5_1999 ;;Fraser, C.W., Automatic inference of models for statistical code compression
QuoteRef: frasCW5_1999a ;;Fraser, C.W., Proebsting, T.A., Finite-state code generation
QuoteRef: frasK5_2007 ;;Fraser, K., Harris, T., Concurrent programming without locks
QuoteRef: frecM4_2015 ;;Frechtling, M., Leong, P.H.W., MCALIB: measuring sensitivity to rounding error with monte carlo programming [NewQuotes]
QuoteRef: fredML7_1999 ;;Fredman, M.L., On the efficiency of pairing heaps and related data structures
QuoteRef: freeBN1_1990 ;;Freeman-Benson, B.N. et al., An incremental constraint solver
QuoteRef: freiFC1_2011 ;;Freiling, F.C. et al., The failure detector abstraction
QuoteRef: freiP4_2000 ;;Frei, P. et al., curlybot: Designing a new class of computational toys
QuoteRef: freiRA11_1974 ;;Freiburghouse, R.A., Register allocation via usage counts
QuoteRef: frieB7_1996 ;;Friedman, B., Nissenbaum, H., Bias in computer systems
QuoteRef: frieFL1_1974 ;;Friedman, F.L., Schneider, V.B, A programming language for mini-computers
QuoteRef: frigM6_1998 ;;Frigo, M. et al., The implementation of the Cilk-5 multithreaded language
QuoteRef: frisME7_1988 ;;Frisse, M.E., Searching for information in a hypertext medical handbook
QuoteRef: fuK2_2002 ;;Fu, K. et al., Fast and secure distributed read-only file system
QuoteRef: fuZ6_2017 ;;Fu, Z., Su, Z., Achieving high coverage for floating-point code via unconstrained programming
QuoteRef: furiCA1_2014 ;;Furia, C.A. et al., Loop invariants: analysis, classification, and examples
QuoteRef: furnGW4_1986 ;;Furnas, G.W., Generalized fisheye views
QuoteRef: furnGW11_1987 ;;Furnas, G.W. et al., The vocabulary problem in human-system communication
QuoteRef: furnGW3_1997 ;;Furnas, G.W., Effective view navigation
QuoteRef: gabeM10_2010 ;;Gabel, M. et al., Scalable and systematic detection of buggy inconsistencies in source code
QuoteRef: galkJT6_1980 ;;Galkowski, J.T., A critique of the DOD common language effort
QuoteRef: gallBA4_1967 ;;Galler, B.A., Perlis, A.J., A proposal for definitions in ALGOL
QuoteRef: gallJA9_1996 ;;Gallian, J.A., Error detection methods
QuoteRef: ganaM10_1981 ;;Ganapathi, M., Fischer, C.N., Bibliography on automated retargetable code generation
QuoteRef: gangG1_2015 ;;Gange, G. et al., Interval analysis and machine arithmetic: why signedness ignorance is bliss [NewQuotes]
QuoteRef: gangG8_2021 ;;Gange, G. et al., A fresh look at zones and octagons [NewQuotes]
QuoteRef: gannJD8_1977 ;;Gannon, J.D., An experimental exaluation of data type conventions
QuoteRef: gannJD_1978 ;;Gannon, J.D., Characteristic errors in programming languages
QuoteRef: gaoQ3_2011 ;;Gao, Q. et al., 2ndStrike: Toward manifesting hidden concurrency typestate bugs
QuoteRef: garcR10_2003 ;;Garcia, R. et al., A comparative study of language support for generic programming
QuoteRef: garnR6_2011 ;;Garner, R. et al., A comprehensive evaluation of object scanning techniques
QuoteRef: gaveWW4_1991 ;;Gaver, W.W., Smith, R.B., Effective sounds in complex systems: The ARKola simulation
QuoteRef: gayD6_2003 ;;Gay, D. et al., The nesC language: A holistic approach to networked embedded systems
QuoteRef: geX4_2017 ;;Ge, X. et al., Griffin: guarding control flows using Intel processor trace
QuoteRef: gebaM3_2018 ;;Gebai, M., Degenais, M.R., Survey and analysis of kernel and userspace tracers on Linux: design, implementation, and overhead [NewQuotes]
QuoteRef: gehaA12_2021 ;;Gehani, A. et al., Digging into big provenance (with SPADE) [NewQuotes]
QuoteRef: geigRS2_2010 ;;Geiger, R.S., Ribes, D., The work of sustaining order in Wikipedia: The banning of a vandal
QuoteRef: gelbB12_2000 ;;Gelbord, B., Signing your 011001010 The problems of digital signatures
QuoteRef: geleD1_1985 ;;Gelernter, D., Generative communication in Linda
QuoteRef: geleD2_1992 ;;Galernter, D., Carriero, N., Coordination languages and their significance
QuoteRef: gellDP7_1974 ;;Geller, D.P., Weinberg, G.M., The principle of sufficient reason. A guide to language design for parallel processing
QuoteRef: gellM5_1978 ;;Geller, M., Test data as an aid in proving program correctness
QuoteRef: gellS3_2012 ;;Gelly, S. et al., The grand challenge of computer go: Monte Carlo tree search and extensions
QuoteRef: genkD6_2016 ;;Genkin, D. et al., Physical key extraction attacks on PCs [NewQuotes]
QuoteRef: gentD8_1996 ;;Gentner, D., Nielson, J., The anti-Mac interface
QuoteRef: georJ12_1977 ;;Georges, J., Heymans, F., On parameteric array expressions
QuoteRef: gescCM6_1975 ;;Geschke, C.M., Mitchell, J.G., On the problem of uniform reference to data structures
QuoteRef: gescCM8_1977 ;;Geschke, C.M. et al., Early experience with Mesa
QuoteRef: gettJ1_2012 ;;Gettys, J., Nichols, K., Bufferbloat: Dark buffers in the Internet
QuoteRef: geweFL5_2021 ;;Gewers, F.L. et al., Principal component analysis: a natural approach to data exploration [NewQuotes]
QuoteRef: ghemS6_2000 ;;Ghemawat, S. et al., Field analysis: getting useful and low-cost interprocedural information
QuoteRef: ghenR7_1978 ;;van Ghent, R., Letter on real software, regarding the commentary by Dijkstra and the reply by DeMillo, Lipton, and Perlis
QuoteRef: gherS10_2003 ;;Ghemawat, S. et al., The Google file system
QuoteRef: ghiyR1_1998 ;;Ghiya, R., Hendren, L.J., Putting pointer analysis to work
QuoteRef: gibsVR3_1989 ;;Gibson, V.R., Senn, J.A., System structure and software maintenance performance
QuoteRef: giffDK4_1982 ;;Gifford, D.K., Cryptographic sealing for information secrecy and authentication
QuoteRef: giffDK12_1985 ;;Gifford, D.K. et al., An architecture for large scale information systems
QuoteRef: giffDK3_1988 ;;Gifford, D.K. et al., The Cedar file system
QuoteRef: gilJ8_2008 ;;Gil, J. (Y.) et al., Two-dimensional bidirectional object layout
QuoteRef: gimpJF6_1972 ;;Gimpel, J.F., Blocks--A new datatype for Snobol 4
QuoteRef: giniGC4_1985 ;;Gini, G.C., Gini, M.L., Dealing with world-model-based programs
QuoteRef: gladHM5_2001 ;;Gladney, H.M., Cantu, A., Authorization management for digital libraries
QuoteRef: glasRL9_1997 ;;Glass, R.L., Cobol--A contradiction and an enigma
QuoteRef: glavB7_2014 ;;Glavic, B. et al., Efficient stream provenance via operator instrumentation
QuoteRef: gleiM10_2019 ;;Gleirscher, M. et al., New opportunities for integrated formal methods [NewQuotes]
QuoteRef: glusRJ5_1989 ;;Glushko, R.J., Transforming text into hypertext for a compact disc encyclopedia
QuoteRef: godbM2_2020 ;;Godbolt, M., Optimizations in C++ compilers [NewQuotes]
QuoteRef: godeP1_1997 ;;Godefroid, P., Model checking for programming languages using VeriSoft
QuoteRef: godeP1_2010 ;;Godefroid, P. et al., Compositional may-must program analysis: unleashing the power of alternation
QuoteRef: godeP3_2012 ;;Godefroid, P. et al., Sage: Whitebox fuzzing for security testing
QuoteRef: gogS7_2016 ;;Gog, S., Venturini, R., Fast and compact hamming distance index
QuoteRef: goldA10_1995 ;;Goldberg, A., Why Smalltalk?
QuoteRef: goldCF6_1981 ;;Goldfarb, C.F., A generalized approach to document markup
QuoteRef: goldD3_1991 ;;Goldberg, D., What every computer scientist should know about floating-point arithmetic
QuoteRef: goldD6_1992 ;;Goldberg, D., The design of floating-point data types
QuoteRef: goldD4_1993 ;;Goldberg, D., Richardson, C., Touch-typing with a stylus
QuoteRef: goldO10_1986 ;;Goldreich, O. et al., How to construct random functions
QuoteRef: goldY11_1992 ;;Goldberg, Y. et al., Active Mail--a framework for implementing groupware
QuoteRef: gongL11_2011 ;;Gong, L., Java security architecture revisited
QuoteRef: gonnGH7_1981 ;;Gonnet, G.H., Coding Benchmark for Utopia84
QuoteRef: goodB8_2017 ;;Goodwin, B. et al., BitFunnel: revisiting signatures for search [NewQuotes]
QuoteRef: goodJB_1968 ;;Goodenough, J.B., The comparison of programming languages: a linguistic approach
QuoteRef: goodJB12_1975 ;;Goodenough, J.B., Exception handling: issues and a proposed notation
QuoteRef: goodM6_1981 ;;Good, M., Etude and the folklore of user interface design
QuoteRef: goodMD10_1984 ;;Good, M.D. et al., Building a user-derived interface
QuoteRef: gordCS10_2012 ;;Gordon, C.S. et al., Uniqueness and reference immutability for safe parallelism
QuoteRef: gordRM3_1990 ;;Gordon, R.M., letter to the editor
QuoteRef: goreM10_2003 ;;Goresky, M., Klapper, A., Efficient multiply-with-carry random number generators with maximal period
QuoteRef: goriJ9_2018 ;;Gori, J. et al., Speed-accuracy tradeoff: A formal information-theoretic transmission scheme (FITTS)
QuoteRef: goroN1_2019 ;;Gorogiannis, N. et al., A true positives theorem for a static race detector [NewQuotes]
QuoteRef: gottA4_1983 ;;Gottlieb, A et al., Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors
QuoteRef: goulJD3_1985 ;;Gould, J.D., Lewis, C., Designing for usability: Key principles and what designers think
QuoteRef: goulJD4_1987 ;;Gould, J.D. et al., Why reading was slower from CRT displays than from paper
QuoteRef: goulJD8_1987 ;;Gould, J.D. et al., The 1984 olympic message system: A test of behavioral principles of system design
QuoteRef: gracG6_2009 ;;Gracioli, G., Fischmeister, S., Tracing interrupts in embedded software
QuoteRef: gracG11_2015 ;;Gracioli, G. et al., A survey on cache management mechanisms for real-time embedded systems
QuoteRef: graeG9_2006 ;;Graefe, G., Implementing sorting in database systems
QuoteRef: graeG7_2009 ;;Graefe, G., The five-minute rule 20 years later (and how flash memory changes the rules)
QuoteRef: grahG6_2018 ;;Grahne, G., Moallemi, A., A useful four-valued database logic [NewQuotes]
QuoteRef: grahRM2_1973 ;;Graham, R.M. et al., A software design and evaluation system
QuoteRef: grahSL6_1982 ;;Graham, S.L. et al., gprof: a call graph execution profiler
QuoteRef: gramFT7_1978 ;;Grampp, F.T., Letter to the editor
QuoteRef: gramV2_2015 ;;Gramoli, V., More than you ever want to know about synchronization. Synchrobench, measuring the impact of synchronization on concurrent algorithms
QuoteRef: granCA12_1971 ;;Grant, C.A., Syntax translation with context macros, or macros without arguments
QuoteRef: grayCG12_1989 ;;Gray, C.G., Cheriton, D.R., Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
QuoteRef: grayDN5_1998 ;;Gray, D.N. et al., Modern languages and Microsoft's component object model
QuoteRef: grayJ8_1988 ;;Gray, J., The cost of messages
QuoteRef: grayJ6_1996 ;;Gray, J. et al., The dangers of replication and a solution
QuoteRef: grayJ6_2003 ;;Gray, J., A conversation with Jim Gray [as interviewed by Dave Patterson]
QuoteRef: grayJ5_2006 ;;Gray, J., A conversation with Werner Vogels
QuoteRef: grayJC_1973 ;;Gray, J.C., Tomlinson, J.C., The L* data language
QuoteRef: greeA3_2011 ;;Greenberg, A. et al., VL2: a scalable and flexible data center network
QuoteRef: greeR12_2011 ;;Green, R., Ledgard, H., Coding guidelines: Finding the art in the science
QuoteRef: gregB2_2013 ;;Gregg, B., Thinking methodically about performance
QuoteRef: gregB6_2016 ;;Gregg, B., The flame graph
QuoteRef: gremLL9_1982 ;;Gremillion, L.L., Designing a Bloom filter for differential file access
QuoteRef: grieD7_1990 ;;Gries, D., letter to the editor
QuoteRef: grieG9_2016 ;;Grieco, G. et al., QuickFuzz: an automatic random fuzzer for common file formats
QuoteRef: grifG7_1987 ;;Grifiths, G., Stones, G.C., The tea-leaf reader algorithm: An efficient implementation of CRC-16 and CRC-32
QuoteRef: grigPF3_1972 ;;Griggith P.F., Henry, R.M., An investigatory study into human problem solving capabilities as they relate to program efficiency
QuoteRef: grimR2_2001 ;;Grimm, R., Bershad, B.N., Separating access control policy, enforcement, and functionality in extensible systems
QuoteRef: grisRE4_1979 ;;Griswold, R.E. et al., The Icon programming language: An overview
QuoteRef: grisRE4_1980 ;;Griswold, R.E., Hanson, D.R., An alternative to the use of patterns in string processing
QuoteRef: grosE5_2021 ;;Grosse, E. et al., Implementing insider defenses [NewQuotes]
QuoteRef: grosR5_2000 ;;Grossi, R., Vitter, J.S., Compressed suffix arrays and suffix trees with applications to text indexing and string matching
QuoteRef: grovLJ11_1982 ;;Groves, L.J., Using simple English sentences to call procedures
QuoteRef: grudJ9_1988 ;;Grudin, J., Why CSCW applications fail: Problems in the design and evaluation of organizational interfaces
QuoteRef: grudJ12_2002 ;;Grudin, J., Group dynamics and ubiquitous computing
QuoteRef: guR10_2019 ;;Gu, R. et al., Building certified concurrent OS kernels [NewQuotes]
QuoteRef: guevM2_2021 ;;Guevara, M. et al., Differential privacy: The pursuit of protections by default [NewQuotes]
QuoteRef: guhaRV2_2016 ;;Guha, R.V. et al., Schema.org: evolution of structured data on the web
QuoteRef: guimML6_2012 ;;Guimaraes, M. L., Silva, A. R., Improving early detection of software merge conflicts
QuoteRef: gullWE2_1979 ;;Gull, W.E., Jenkins, M.A., Recursive data structures in APL
QuoteRef: gulwS1_2004 ;;Gulwani, S., Necula, G.C., Global value numbering using random interpretation
QuoteRef: guoP9_2014 ;;Guo, P., Small-group code reviews for education (blog@cacm)
QuoteRef: guoPJ3_2013 ;;Guo, P.J., Online python tutor: embeddable web-based program visualization for CS education
QuoteRef: guptA7_2016 ;;Gupta, A. et al., Mesa: A geo-replicated online data warehouse for Google's advertising system
QuoteRef: guptD10_2010 ;;Gupta, D. et al., Difference engine: harnessing memory redundancy in virtual machines
QuoteRef: guptI8_2001 ;;Gupta, I. et al., On scalable and efficient distributed failure detectors
QuoteRef: guptR3_1993 ;;Gupta, R., Optimizing array bound checks using flow analysis
QuoteRef: guptR3_1994 ;;Gupta, R. et al., On randomization in sequential and distributed algorithms
QuoteRef: gutkJ9_1985 ;;Gutknecht, J., Concepts of the text editor Lara
QuoteRef: guttJV6_1977 ;;Guttag, J.V., Abstract data types and the development of data structures
QuoteRef: guyI3_2018 ;;Guy, I., The characteristics of voice search: comparing spoken with typed-in mobile web search queries
QuoteRef: guyeSZ6_2006 ;;Guyer, S.Z. et al., Free-me: a static analysis for automatic individual object reclamation.
QuoteRef: haasA6_2017 ;;Haas, A. et al., Bringing the web up to speed with WebAssembly
QuoteRef: hackB6_2012 ;;Hackett, B., Guo, S., Fast and precise hybrid type inference of JavaScript
QuoteRef: hagmR_1987 ;;Hagmann, R., Reimplementing the Cedar File system using logging and group commit
QuoteRef: hainDP3_1997 ;;Haine, D.P., Claris Organizer's expanding contact card
QuoteRef: halaF2_1994 ;;Halasz, F.A., Schwartz, M., The Dexter Reference Model
QuoteRef: halaFG4_1987 ;;Halasz, F.G. et al., NoteCards in a nutshell
QuoteRef: halaFG7_1988 ;;Halasz, F.G., Reflections on Notecards: Seven issues for the next generation of hypermedia systems
QuoteRef: haleS8_1999 ;;Halevi, S., Krawczyk, H., Public-key cryptography and password protocols
QuoteRef: hallDE9_1980 ;;Hall, D.E. et al., A virtual operating system
QuoteRef: halpMI1_1968 ;;Halpern, M.I., Toward a general processor for programming languages
QuoteRef: halsMH_1975 ;;Halstead, M.H., Toward a theoretical basis for estimating programming effort
QuoteRef: hamiJ2_2003 ;;Hamilton, J., Language interpretation in the Common Language Runtime
QuoteRef: hammC5_2008 ;;Hammer, C. et al., Dynamic detection of atomic-set-serializability violations
QuoteRef: hammMA10_2016 ;;Hammer, M.A. et al., A vision for online verification-validation
QuoteRef: hanaS8_1980 ;;Hanata, S., Satoh, T., COMPACT CHART -- A program logic notation with high describability and understandability
QuoteRef: hansDR5_1978 ;;Hanson, D.R., The SL5 procedure mechanism
QuoteRef: hansR_1987 ;;Hanson, R., Toward hypertext publishing. Issues and choices in database design
QuoteRef: hansWJ9_1988 ;;Hansen, W.J., Haas, C., Reading and writing with computers: A framework for explaining differences in performance
QuoteRef: hansWJ10_1992 ;;Hansen, W.J., Subsequence references: First-class values for substrings
QuoteRef: harbSP3_1982 ;;Harbison, S.P., An architectural alternative to optimizing compilers
QuoteRef: hardB6_2007 ;;Hardekopf, B., Lin, C., The ant and the grasshopper: Fast and accurate pointer analysis for millions of lines of code
QuoteRef: hardB1_2009 ;;Hardekopf, B., Lin, C., Semi-sparse flow-sensitive pointer analysis
QuoteRef: hareD5_1988 ;;Harel, D., On visual formalisms
QuoteRef: harrJ10_1998 ;;Harris, J., Sarkar, V., Lightweight object-oriented shared variables for distributed applications on the Internet
QuoteRef: harrMA3_2004 ;;Harris, M.A., Reingold, E.M., Line drawing, leap years, and Euclid
QuoteRef: harrR10_2015 ;;Harris, R., Dismantling the barriers to entry
QuoteRef: harrT10_2003 ;;Harris, T., Fraser, K., Language support for lightweight transactions
QuoteRef: harrT8_2008 ;;Harris, T. et al., Composable memory transactions
QuoteRef: harrWR6_2011 ;;Harris, W.R., Gulwani, S., Spreadsheet table transformations from examples
QuoteRef: hartH7_2016 ;;Hartmann, H., Statistics for engineers
QuoteRef: hartJ2_2011 ;;Harty, J., Finding usability bugs with automated tests
QuoteRef: hartPE6_2003 ;;Hart, P.E., Liu, Z., Trust in the preservation of digital information
QuoteRef: hartPH12_2001 ;;Hartel, P.H., Moreau, L., Formalizing the safety of Java, the Java virtual Machine, and Java Card
QuoteRef: hasaR12_2009 ;;Hasan, R. et al., Preventing history forgery with secure provenance
QuoteRef: haskJA8_1984 ;;Haskett, J.A., Pass-algorithms: A user validation scheme based on knowledge of secret algorithms
QuoteRef: haslB2_2010 ;;Haslhofer, B., Klas, W., A survey of techniques for achieving metadata interoperability
QuoteRef: hatcJ6_2012 ;;Hatcliff, J. et al., Behavioral interface specification languages
QuoteRef: hathC6_2015 ;;Hathhorn, C. et al., Defining the undefinedness of C*
QuoteRef: hausRC11_1994 ;;Hauser, R.C., Does licensing require new access control techniques?
QuoteRef: hauzBM10_1986 ;;Hauzeur, B.M., A model for naming, addressing, and routing
QuoteRef: hawbC7_2017 ;;Hawblitzel, C. et al., IronFleet: proving safety and liveness of practical distributed systems
QuoteRef: haydCM10_2012 ;;Hayden, C.M. et al., Kitsune: efficient, general-purpose dynamic software updating for C
QuoteRef: heckP4_1978 ;;Heckel, P., A technique for isolating differences between files
QuoteRef: heerJ4_1985 ;;Heering, J., Klint, P., Towards monolingual programming environments
QuoteRef: heerJ11_1989 ;;Heering, J. et al., The syntax definition formalism SDF
QuoteRef: hehnEC_1977 ;;Hehner, E.C.R., Structuring
QuoteRef: hehnEC2_1984 ;;Hehner, E.C.R., Predicative Programming Part 1
QuoteRef: heidS6_2018 ;;Heidari, S. et al., Scalable graph processing frameworks: a taxonomy and open challenges
QuoteRef: heinDL6_2003 ;;Heine, D.L., Lam, M.S., A practical flow-sensitive and context-sensitive C and C++ memory leak detector
QuoteRef: heinN6_2001 ;;Heintze, N., Tardieu, O., Ultra-fast aliasing analysis using CLA: A million lines of C code in a second
QuoteRef: heinS4_2002 ;;Heinz, S. et al., Burst tries: a fast, efficient data structure for string keys
QuoteRef: hekmS9_1986 ;;Hekmatpour, S., Ince, D.C., Forms as a language facility
QuoteRef: hellJM9_2020 ;;Hellerstein, J.M., Alvaro, P., Keeping CALM: when distributed consistency is easy [NewQuotes]
QuoteRef: hellP4_2012 ;;Helland, P., Idempotence is not a medical condition
QuoteRef: hellP2_2017 ;;Helland, P., Life beyond distributed transactions
QuoteRef: hellP11_2020 ;;Helland, P., Data on the outside versus data on the inside [NewQuotes]
QuoteRef: hemmD3_1988 ;;Hemmendinger, D., Unfair process scheduling in Modula-2
QuoteRef: hendDA7_1986 ;;Henderson, D.A., Jr., Card, S.K., Rooms: The use of multiple virtual workspaces to reduce space contention in a window-based graphical user interface
QuoteRef: hennJ3_1982 ;;Hennessy, J. et al., Hardware/ Software tradeoffs for increased performance
QuoteRef: henzMR7_1999 ;;Henzinger, M.R., King, V., Randomized fully dynamic graph algorithms with polylogarithmic time per operation
QuoteRef: henzTA6_2005 ;;Henzinger, T.A. et al., Composable code generation for distributed Giotto
QuoteRef: herhS10_2013 ;;Herhut, S. et al., River trail: A path to parallelism in JavaScript
QuoteRef: herlM10_1982 ;;Herlihy, M., Liskov, B., A value transmission method for abstract data types
QuoteRef: herlM1_1991 ;;Herlihy, M., Wait-free synchronization
QuoteRef: herlM11_1993 ;;Herlihy, M., A methodology for implementing highly concurrent data objects
QuoteRef: herlMP7_1990 ;;Herlihy, M.P., Wing, J.M., Linearizability: a correctness condition for concurrent objects
QuoteRef: hertM6_2005 ;;Hertz, M. et al., Garbage collection without paging
QuoteRef: hertM10_2005 ;;Hertz, M., Berger, E.D., Quantifying the performance of garbage collection vs. explicit memory management
QuoteRef: heulS6_2016 ;;Heule, S. et al., Stratified synthesis: automatically learning the x86-64 instruction set
QuoteRef: heumST2_2013 ;;Heumann, S.T. et al., The tasks with effects model for safe concurrency
QuoteRef: hewiC7_1986 ;;Hewitt, C., Offices are open systems
QuoteRef: heydA6_2000 ;;Heydon, A. et al., Caching function calls using precise dependencies
QuoteRef: hillRK11_2019 ;;Hill, R.K., Voting, coding, and the code [NewQuotes]
QuoteRef: hillWD12_1986 ;;Hillis, W.D., Steele, G.L., Jr., Data parallel algorithms
QuoteRef: hiltSR7_1985 ;;Hiltz, S.R., Turoff, M., Structuring computer-mediated communication systems to avoid information overload
QuoteRef: hincK9_1998 ;;Hinckley, K. et al., Two-handed virtual manipulation
QuoteRef: hindA5_2016 ;;Hindle, A. et al., On the naturalness of software
QuoteRef: hindM8_2000 ;;Hind, M., Pioli, A., Which pointer analysis should I use?
QuoteRef: hitzP2_2021 ;;Hitzler, P., A review of the semantic web field [NewQuotes]
QuoteRef: hoarCA_1973 ;;Hoare, C.A.R., Hints on programming language design
QuoteRef: hoarCA10_1974 ;;Hoare, C.A.R., Monitors: An operating system structuring concept
QuoteRef: hoarCA8_1978 ;;Hoare, C.A.R., Communicating sequential processes
QuoteRef: hoarCA8_1987 ;;Hoare, C.A.R. et al., Laws of programming
QuoteRef: hollGH12_1971 ;;Holloway, G.H., Interpreter/compiler integration in ECL
QuoteRef: holmJ9_2020 ;;Holmes, J. et al., Using relative lines of code to guide automated test generation for Python [NewQuotes]
QuoteRef: holtAW5_1958 ;;Holt, A.W., General purpose programming systems
QuoteRef: holtAW10_1961 ;;Holt, A.W., Program organization and record keeping for dynamic storage allocation
QuoteRef: holtAW_1970 ;;Holt, A.W., Commoner, F., Events and conditions
QuoteRef: holzGJ11_2002 ;;Holzmann, G.J., The logic of bugs
QuoteRef: holzGJ2_2014 ;;Holzmann, G.J., Mars code
QuoteRef: homeM10_2012 ;;Homer, M. et al., Patterns as objects in Grace
QuoteRef: homeM10_2015 ;;Homer, M. et al., From APIs to languages: generalising method names
QuoteRef: hongC6_2016 ;;Hong, C. et al., Effective padding of multidimensional arrays to avoid cache conflict misses
QuoteRef: hookS12_2021 ;;Hooker, S., The hardware lottery [NewQuotes]
QuoteRef: hornAJ9_2001 ;;Hornof, A.J., Visual search and mouse-pointing in labeled versus unlabeled two-dimensional visual hierarchies
QuoteRef: hornK8_2007 ;;Hornbaek, K., Hertzum, M., Untangling the usability of fisheye menus
QuoteRef: hoveD12_2004 ;;Hovemeyer, D., Pugh, W., Finding bugs is easy
QuoteRef: howaJH2_1988 ;;Howard, J.H. et al., Scale and Performance in a distributed file system
QuoteRef: howdWE12_1989 ;;Howden, W.E., Validating programs without specifications
QuoteRef: hsiaCH4_2017 ;;Hsiao, C.-H. et al., AsyncClock: scalable inference of asynchronous event causality
QuoteRef: huY3_2018 ;;Hu, Y., Neamtiu, I., Static detection of event-based races in android apps
QuoteRef: huanJ6_2014 ;;Huang, J. et al., Maximal sound predictive race detection with control flow abstraction
QuoteRef: huanJ4_2017 ;;Huang, J. et al., Pallas: semantic-aware checking for finding deep bugs in fast path
QuoteRef: huanY4_2010 ;;Huang, Y. et al., Detecting bugs in register allocation
QuoteRef: hughJA11_1992 ;;Hughes, J.A., Faltering from ethnography to design
QuoteRef: huiRKW8_1991 ;;Hui, R.K.W. et al., Tacit definition
QuoteRef: hullTE9_1988 ;;Hull, T.E. et al., Exception handling in scientific computing
QuoteRef: huntJG1_1979 ;;Hunt, J.G., Messages in typed languages
QuoteRef: huntJJ4_1998 ;;Hunt, J.J. et al., Delta algorithms: an empirical analysis
QuoteRef: hursN9_2009 ;;Hurst, N. et al., Review of automatic document formatting
QuoteRef: hustS1_2014 ;;Huston, S. et al., Indexing word sequences for ranked retrieval
QuoteRef: hwanAA3_2012 ;;Hwang, A.A. et al., Cosmic rays don't strike twice: Understanding the nature of DRAM errors and the implications for system design
QuoteRef: ieruR7_2011 ;;Ierusalimschy, R. et al., Passing a language through the eye of a needle
QuoteRef: ilyaIF10_2008 ;;Ilyas, I.F. et al., A survey of top-k query processing techniques in relational database systems
QuoteRef: ingaD10_1997 ;;Ingalls, D. et al., Back to the future. The story of Squeak, a practical Smalltalk written in itself
QuoteRef: ingaDH9_1986 ;;Ingalls, D.H.H., A simple technique for handling multiple polymorphism
QuoteRef: ingePZ1_1961 ;;Ingerman, P.Z., Thunks, a way of compiling procedure statements with some comments on procedure declarations
QuoteRef: ironET1_1969 ;;Irons, E.T., Experience with an extensible language
QuoteRef: israC6_2015 ;;Isradisaikul, C., Myers, A.C., Finding counterexamples from parsing conflicts
QuoteRef: ivieEL10_1977 ;;Ivie, E.L., The programmer's workbench--a machine for software development
QuoteRef: ivieP7_2018 ;;Ivie, P., Thain, D., Reproducibility in scientific computing
QuoteRef: ivorMY12_2001 ;;Ivory, M.Y., Hearst, M.A., The state of the art in automating usability evaluation of user interfaces
QuoteRef: jackD6_1993 ;;Jackson, D., Abstract analysis with Aspect
QuoteRef: jacoA8_2009 ;;Jacobs, A., The pathologies of big data
QuoteRef: jaesG12_1981 ;;Jaeschke, G., Reciprocal hashing: A method for generating minimal perfect hashing functions
QuoteRef: jainAK9_1999 ;;Jain, A.K. et al., Data clustering: a review
QuoteRef: jainR10_1985 ;;Jain, R., Chlamtac, I., The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations.
QuoteRef: jakoM11_2001 ;;Jakobsson, M., Reiter, M.K., Discouraging software piracy using software aging
QuoteRef: jansBJ1_1998 ;;Jansen, B.J. et al., Real life information retrieval: a study of user queries on the web
QuoteRef: jeffDR7_1985 ;;Jefferson, D.R., Virtual time
QuoteRef: jeniJC2_2011 ;;Jenista, J.C. et al., OoOJava: Software Out-of-Order Execution
QuoteRef: jensC4_2000 ;;Jensen, C. et al., The effect of communication modality on cooperation in online environments
QuoteRef: jimT1_2010 ;;Jim, T. et al., Semantics and algorithms for data-dependent grammars
QuoteRef: jinG6_2012 ;;Jin, G. et al., Understanding and detecting real-world performance bugs
QuoteRef: jinH8_2021 ;;Jin, H. et al., Lean privacy review: Collecting users' privacy concerns of data practices at a low cost [NewQuotes]
QuoteRef: jiroM12_1993 ;;Jirotk, M. et al., Requirements for technology in complex environments: Tasks and interaction in a city dealing room
QuoteRef: johnB9_2009 ;;Johnson, B., Reveling in constraints
QuoteRef: johnMS2_1982 ;;Johnson, M.S., A software debugging glossary
QuoteRef: johnMS3_1982 ;;Johnson, M_S., Some requirements for architectural support of software debugging
QuoteRef: johnMS10_1998 ;;Johnstone, M.S., Wilson, P.R., The memory fragmentation problem: solved?
QuoteRef: johnRI3_1976 ;;Johnson, R.I., Mories, J.B., Abstract data types in the Model programming language
QuoteRef: johnRK3_1982 ;;Johnsson, R.K., Wick, J.D., An overview of the Mesa processor architecture
QuoteRef: joisPG6_2014 ;;Joisha, P.G., Sticky tries: Fast insertions, fast lookups, no deletions for large key universes
QuoteRef: joneAK5_1978 ;;Jones, A.K., A language extension for expressing constraints on data access
QuoteRef: joneSL2_1986 ;;Jones, S.L.P., Parsing distfix operators
QuoteRef: joneSP9_2000 ;;Jones, S.P. et al., Composing contracts: an adventure in financial engineering
QuoteRef: joneSP8_2003 ;;Jones, S.P. et al., A user-centered approach to functions in Excel
QuoteRef: joneWP1_1986 ;;Jones, W.P., Dumais, S.T., The spatial metaphor for user interfaces: Experimental tests of reference by location versus name
QuoteRef: jongM12_2012 ;;de Jonge, M. et al., Natural and flexible error recovery for generated modular language environments
QuoteRef: jonsD8_1987 ;;Jonsson, D., Pancode and boxcharts: Structured programming revisited
QuoteRef: jorrU1_1986 ;;Jorring, U., Scherlis, W.L., Compilers and staging transformations
QuoteRef: joseWK9_2010 ;;Josephson, W.K. et al., DFS: A file system for virtualized flash storage
QuoteRef: joshP6_2009 ;;Joshi, P. et al., A randomized dynamic program analysis technique for detecting real deadlocks
QuoteRef: joshR6_2002 ;;Joshi, R. et al., Denali: a goal-directed superoptimizer
QuoteRef: joveRP12_2020 ;;Jover, R.P., Security analysis of SMS as a second factor of authentication [NewQuotes]
QuoteRef: jumpM1_2007 ;;Jump, M., McKinley, K.S., Cork: dynamic memory leak detection for garbage-collected languages
QuoteRef: jungR4_2021 ;;Jung, R. et al., Safe systems programming in Rust [NewQuotes]
QuoteRef: kabbP4_1993 ;;Kabbash, P. et al., Human performance using computer input devices in the preferred and non-preferred hands
QuoteRef: kadaA3_2012 ;;Kadav, A., Swift, M.M., Understanding modern device drivers
QuoteRef: kaehT9_1986 ;;Kaehler, T., Virtual memory on a narrow machine for an object-oriented language
QuoteRef: kakhAM7_2019 ;;Kakhki, A.M. et al., Taking a long look at QUIC [NewQuotes]
QuoteRef: kaliS3_2016 ;;Kalikar, S., DomLock: a new multi-granularity locking technique for hierarchies
QuoteRef: kaliT6_2013 ;;Kalibera, T., Jones, R., Rigorous benchmarking in reasonable time
QuoteRef: kampPH7_2004 ;;Kamp, P.-H., Watson, R., Building systems to be shared securely
QuoteRef: kampPH5_2011 ;;Kamp, P.-H., The one-second war
QuoteRef: kandS8_2009 ;;Kandula, S. et al., Detailed diagnosis in enterprise networks
QuoteRef: kangJ1_2017 ;;Kang, J. et al., A promising semantics for relaxed-memory concurrency
QuoteRef: kaniC9_2009 ;;Kanich, C. et al., Spamalytics: an empirical analysis of spam marketing conversion
QuoteRef: kanvV6_2016 ;;Kanvar, V., Khedker, U.P., Heap abstractions for static analysis
QuoteRef: kaplSJ7_1990 ;;Kaplan, S.J. et al., Agenda: A personal information manager
QuoteRef: karaCM12_1998 ;;Karat, C.-M., Guaranteeing rights for the user
QuoteRef: karaCM5_1999 ;;Karat, C.-M. et al., Patterns of entry and correction in large vocabulary continuous speech recognition systems
QuoteRef: karaV6_1999 ;;Karamcheti, V. et al., A core library for robust numeric and geometric computation
QuoteRef: kargD5_1997 ;;Karger, D. et al., Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
QuoteRef: kariRR7_1987 ;;Karinthi, R.R., Weiser, M., Incremental re-execution of programs
QuoteRef: karpAH12_2003 ;;Karp, A.H., Enforce POLA on processes to control viruses
QuoteRef: karrM5_1978 ;;Karr, M., Loveman, D.B., III, Incorporation of units into programming languages
QuoteRef: karrM6_1984 ;;Karr, M., Code generation by coagulation
QuoteRef: kaszM10_1999 ;;Kaszkiel, M. et al., Efficient passage ranking for document databases
QuoteRef: katzJ12_1971 ;;Katzenelson, J., Milgram, E., A short presentation of the main features of AEPL--An extensible programming languages
QuoteRef: kawaK11_2002 ;;Kawachiya, K. et al., Lock reservation: Java locks can mostly do without atomic operations
QuoteRef: kawaM11_2000 ;;Kawahito, M. et al., Effective null pointer check elimination utilizing hardware trap
QuoteRef: kawaM6_2002 ;;Kawahito, M. et al., Effective sign extension elimination
QuoteRef: kayA3_1993 ;;Kay, A., The history of Smalltalk
QuoteRef: kayAC_1996 ;;Kay, A.C., The early history of Smalltalk, with transcript of presentation
QuoteRef: kearM10_2012 ;;Kearns, M., Experiments in social computation
QuoteRef: kediP6_2017 ;;Kedia, P. et al., Simple, fast, and safe manual memory management
QuoteRef: kellD5_1990 ;;Keller, D., A guide to natural naming
QuoteRef: kellS11_2016 ;;Kell, S. et al., The missing link: explaining ELF static linking, semantically [NewQuotes]
QuoteRef: kellT9_2020 ;;Kelly, T., Is persistent memory persistent? [NewQuotes]
QuoteRef: kemeCF2_1993 ;;Kemerer, C.F., Reliability of function points measurement
QuoteRef: kemmB9_2000 ;;Kemme, B., Alonso, G., A new approach to developing and implementing eager database replication protocols
QuoteRef: kennA6_2001 ;;Kennedy, A., Syme, D., Design and implementation of generics for the .NET common language runtime
QuoteRef: kennMS3_1983 ;;Kenniston, M.S., et al, Implementation Issues II (session summary)
QuoteRef: keppD4_1991 ;;Keppel, D., A portable interface for on-the-fly instruction space modification
QuoteRef: keppE10_1977 ;;Keppel, E., Kropp, D., Interactive programming by end-users
QuoteRef: kermH6_2006 ;;Kermany, H., Petrank, E., The compressor: concurrent, incremental and parallel compaction
QuoteRef: kessPB6_1990 ;;Kessler, P.B., Fast breakpoints: design and implementation
QuoteRef: khanF10_2014 ;;Khan, F. et al., Using JavaScript and WebCL for numerical computations: A comparative study of native and web technologies
QuoteRef: kharM10_2006 ;;Kharbutli, M. et al., Comprehensively and efficiently protecting the heap
QuoteRef: kietP7_2021 ;;Kietzmann, P. et al., A guideline on pseudorandom number generation (PRNG) in the IoT [NewQuotes]
QuoteRef: kiljS10_2016 ;;Kiljan, S. et al., A survey of authentication and communications security in online banking
QuoteRef: killT3_2021 ;;Killalea, T., A second conversation with Werner Vogels [NewQuotes]
QuoteRef: kimS_1999 ;;Kim, S., A new string-pattern matching algorithm using partitioning and hashing efficiently
QuoteRef: kindG10_2012 ;;Kindler, G. et al., Spherical cubes: Optimal foams from computational hardness amplification
QuoteRef: kingJC7_1976 ;;King, J.C., Symbolic execution and program testing
QuoteRef: kiniD6_2017 ;;Kini, D. et al., Dynamic race prediction in linear time
QuoteRef: kinsK7_2011 ;;Kinshumann, K. et al., Debugging in the (very) large: Ten years of implementation and experience
QuoteRef: kiseO1_2017 ;;Kiselyov, O. et al., Stream fusion, to completeness
QuoteRef: kistJJ2_1992 ;;Kistler, J.J., Satyanarayanan, M., Disconnected operation in the Coda file system
QuoteRef: kleiG10_2018 ;;Klein, G et al., Formally verified software in the real world
QuoteRef: kleiJM9_1999 ;;Kleinberg, J.M., Authoritative sources in a hyperlinked environment
QuoteRef: kleiST7_1989 ;;Klein, S.T. et al., Storing text retrieval systems on CD-ROM: Compression and encryption considerations
QuoteRef: klemR6_1999 ;;Klemm, R., Practical guidelines for boosting Java server performance
QuoteRef: klepM5_2019 ;;Kleppmann, M. et al., Online event processing [NewQuotes]
QuoteRef: klerM3_1988 ;;Klerer, M., Liu, H.,, A new benchmark test to estimate optimization quality of compilers
QuoteRef: klinM10_2012 ;;Kling, M. et al., Bolt: on-demand infinite loop escape in unmodified binaries
QuoteRef: klinP10_1979 ;;Klint, P., Line numbers made cheap
QuoteRef: klinR2_1979 ;;Kling, R., Scacchi, W., The DOD common high order programming language effort (DOD-1): What will the impacts be?
QuoteRef: knigK11_1990 ;;Knight, K., Connectionist ideas and algorithms
QuoteRef: knooJ6_1992 ;;Knoop, J. et al., Lazy code motion
QuoteRef: knowK10_1965 ;;Knowlton, K., A fast storage allocator
QuoteRef: knowK8_1966 ;;Knowlton, K., A programmer's description of L^_6
QuoteRef: knoxST5_1989 ;;Knox, S.T. et al., Directed dialogue protocols: Verbal data for user interface design
QuoteRef: knutDE4_1961 ;;Knuth, D.E., Minimizing drum latency time
QuoteRef: knutDE7_1972 ;;Knuth, D.E., Ancient Babylonian algorithms
QuoteRef: knutDE4_1976 ;;Knuth, D.E., Big omicron and big omega and big theta
QuoteRef: koAJ4_2004 ;;Ko, A.J., Myers, B.A., Designing the Whyline: A debugging interface for asking questions about program behavior
QuoteRef: kochP7_2020 ;;Kocher, P. et al., Spectre attacks: exploiting speculative execution [NewQuotes]
QuoteRef: kochPD11_1987 ;;Koch, P.D.L., Disk file allocation based on the buddy system
QuoteRef: kosiPR9_1973 ;;Kosinski, P.R., A data flow language for operating system programming
QuoteRef: koskE6_2015 ;;Koskinen, E., Parkinson, M., The push/pull model of transactions
QuoteRef: koutI10_2012 ;;Koutis, I. et al., A fast solver for a class of linear systems
QuoteRef: kovaTA11_1978 ;;Kovats, T.A., Program readability, closing keywords and prefix-style intermediate keywords
QuoteRef: krisS8_2020 ;;Krishnamurthi, S., Fisler, K., Data-Centricity: a challenge and opportunity for computing education [NewQuotes]
QuoteRef: krisSM7_1990 ;;Krishnamurthy, S.M., A brief survey of papers on scheduling for pipelined processors
QuoteRef: krizhA6_2017 ;;Krizhevsky, A. et al., ImageNet classification with deep convolutional neural networks
QuoteRef: krolP5_1971 ;;Krolak, P. et al., A man-machine approach toward solving the traveling salesman problem
QuoteRef: krovR4_1992 ;;Krovetz, R., Croft, W.B., Lexical ambiguity and information retrieval
QuoteRef: krueCW6_1992 ;;Krueger, C.W., Software reuse
QuoteRef: kuhnF9_2008 ;;Kuhn, F. et al., Distributed selection: a missing piece of data aggregation
QuoteRef: kulkC12_2013 ;;Kulkarni, C. et al., Peer and self assessment in massive online classes
QuoteRef: kumaS6_2001 ;;Kumar, S. et al., ESP: A language for programmable devices
QuoteRef: kumaS6_2002 ;;Kumar, S., Li, K., Dynamic memory management for programmable devices
QuoteRef: kumaV10_2012 ;;Kumar, V. et al., Work-stealing without the baggage
QuoteRef: kwokYK12_1999 ;;Kwok, Y.-K., Ahmad, I., Static scheduling algorithms for allocating directed task graphs to multiprocessors
QuoteRef: laiKY10_1988 ;;Lai, K.-Y. et al., Object Lens: a "spreadsheet" for coooperative work
QuoteRef: lammM9_2000 ;;Lamming, M. et al., Satchel: Providing access to any document, any time, anywhere
QuoteRef: lampB11_1992 ;;Lampson, B. et al., Authentication in distributed systems: Theory and Practice
QuoteRef: lampB11_2009 ;;Lampson, B., Usable security: how to get it
QuoteRef: lampBW2_1980 ;;Lampson, B.W., Redell, D.D., Experience with processes and monitors in Mesa
QuoteRef: lampBW6_1983 ;;Lampson, B.W., Schmidt, E.E., Organizing software in a distributed environment
QuoteRef: lampBW10_1983 ;;Lampson, B.W., Hints for computer system design
QuoteRef: lampBW8_1985 ;;Lampson, B.W., Designing a global name service
QuoteRef: lampL7_1978 ;;Lamport, L., Time, clocks, and the ordering of events in a distributed system
QuoteRef: lampL1_1989 ;;Lamport, L., A simple approach to specifying concurrent systems
QuoteRef: lampL7_1990 ;;Lamport, L., win and sin Predicate transformers for concurrency
QuoteRef: lampL5_1994 ;;Lamport, L., The temporal logic of actions [NewQuotes]
QuoteRef: lampL5_1998 ;;Lamport, L., The part-time parliament
QuoteRef: lampL4_2015 ;;Lamport, L., Viewpoint: Who builds a house without drawing blueprints?
QuoteRef: lampL6_2015 ;;Lamport, L., The computer science of concurrency: The early years
QuoteRef: landCE9_1994 ;;Landwehr, C.E. et al., A taxonomy of computer program security flaws
QuoteRef: landPJ2_1965 ;;Landin, P.J., A correspondence between ALGOL 60 and Church's lambda-notation: Part 1
QuoteRef: landPJ3_1966 ;;Landin, P.J., The next 700 programming languages
QuoteRef: landTK7_1983 ;;Landauer, T.K. et al., Natural command names and initial learning: A study of text-editing terms
QuoteRef: larsJ3_2009 ;;Larson, J., Erlang for concurrent programming
QuoteRef: larsPA10_1980 ;;Larson, P.-A., Linear hashing with partial expansions
QuoteRef: larsPA4_1988 ;;Larson, P.-A., Dynamic hash tables
QuoteRef: larsPA9_1988 ;;Larson, P.-A., Linear hashing with separators--A dynamic hashing scheme achieving one- access retrieval
QuoteRef: larsPA10_1998 ;;Larson, P.-A.-, Krishnan, M., Memory allocation for long-running server applications
QuoteRef: laruJ8_2010 ;;Larus, J., Hunt, G., The singularity system
QuoteRef: lattC6_2007 ;;Lattner, C. et al., Making context-sensitive points-to analysis with heap cloning practical for the real world
QuoteRef: laurB10_2014 ;;Laurie, B., Certificate transparency
QuoteRef: leV6_2014 ;;Le, V. et al., Compiler validation via equivalence modulo inputs
QuoteRef: leV10_2015 ;;Le, V. et al., Finding deep compiler bugs via guided stochastic program mutation
QuoteRef: leag1_1992 ;;The League for Programming Freedom, Against software patents
QuoteRef: leavGT2_1984 ;;Leavens, G.T., Prettyprinting styles for various languages.
QuoteRef: leblDB5_1984 ;;Leblang, D.B., Chase, R.P. Jr., Computer-aided software engineering in a distributed workstation environment
QuoteRef: lechR_1973 ;;Lechner, R., Stallings, W., A minisystem programming language
QuoteRef: lecuP10_1990 ;;L'Ecuyer, P., Random numbers for simulation
QuoteRef: lecuP3_1991 ;;L'Ecuyer, P., Cote, S., Implementing a random number package with splitting facilities
QuoteRef: lecuP8_2007 ;;L'Ecuyer, P., Simard, R., TestU01: A C library for empirical testing of random number generators
QuoteRef: ledgH10_1980 ;;Ledgard, H. et al., The natural language of interactive systems.
QuoteRef: ledgHF11_1975 ;;Ledgard, H.F., Marcotty, M., A genealogy of control structures
QuoteRef: ledgHF7_1977 ;;Ledgard, H.F. et al., A basis for executing Pascal programmers
QuoteRef: ledgHF10_1980 ;;Ledgard, H.F., A human engineered variant to BNF
QuoteRef: leeE4_1993 ;;Lee, E., Whalen, T., Computer image retrieval by features: Suspect identification
QuoteRef: leeHT4_2008 ;;Lee, H.-T. et al., IRLbot: scaling to 6 billion pages and beyond
QuoteRef: leeJ3_1988 ;;Lee, J., Malone, T.W., How can groups communicate when they use different languages?
QuoteRef: leeJ1_1990 ;;Lee, J., Malone, T.W., Partially shared views: A scheme for communicating among groups that use different type hierarchies
QuoteRef: leeJ6_2017 ;;Lee, J. et al., Taming undefined behavior in LLVM [NewQuotes]
QuoteRef: leeJ11_2018 ;;Lee, J. et al., Reconciling high-level optimizations and low-level code in LLVN [NewQuotes]
QuoteRef: leeMW11_2010 ;;Lee, M.-W. et al., Instant code clone search
QuoteRef: leeW6_2016 ;;Lee, W. et al., Verifying bit-manipulations of floating-point
QuoteRef: leesT4_2016 ;;Leesatapornwongsa, T. et al., TaxDC: a taxonomy of non-deterministic concurrency bugs in datacenter distributed systems
QuoteRef: lefeG3_2012 ;;Lefebvre, G. et al., Execution mining
QuoteRef: lehmF12_1988 ;;Lehman, F., letter to the editor
QuoteRef: leijD10_2009 ;;Leijen, D. et al., The design of a task parallel library
QuoteRef: leinDW5_1980 ;;Leinbaugh, D.W., Indenting for the compiler
QuoteRef: leitL11_2019 ;;Leite, L. et al., A survey of devops concepts and challenges [NewQuotes]
QuoteRef: leonY12_2002 ;;Leontiev, Y. et al., On type systems for object-oriented database programming languages
QuoteRef: leroX1_1998 ;;Leroy, X., Rouaix, F., Security properties of typed applets
QuoteRef: leroX7_2009 ;;Leroy, X., Formal verification of a realistic compiler
QuoteRef: levaY10_2001 ;;Lebanon, Y., Pet rank, E., An on-the-fly reference counting garbage collector for Java
QuoteRef: levaY1_2006 ;;Levanoni, Y., Petrank, E., An on-the-fly reference-counting garbage collector for Java
QuoteRef: leveA7_2008 ;;Leventhal, A., Flash storage memory
QuoteRef: leveB7_1980 ;;Leverett, B., Szymanski, T.G., Chaining span-dependent jump instructions
QuoteRef: leviJ5_1980 ;;Levine, J., Why a lisp-based command language?
QuoteRef: leviP7_2008 ;;Levis, P. et al., The emergence of a networking primitive in wireless sensor networks
QuoteRef: levyEB11_1982 ;;Levy, E.B., The case against Pascal as a teaching tool
QuoteRef: lewiB11_2020 ;;Lewis, B., Vogel, D., Longer delays in rehearsal-based interfaces increase expert use [NewQuotes]
QuoteRef: lhotO1_2011 ;;Lhotak, O., Chung, K.-C. A., Points-to analysis with efficient strong updates
QuoteRef: liG4_2020 ;;Li, G. et al., A survey of renamings of software entities [NewQuotes]
QuoteRef: liJ3_2016 ;;Li, J. et al., Work stealing for interactive services to meet target latency
QuoteRef: liP8_2011 ;;Li, P., Konig, A.C., Theory and applications of b-bit minwise hashing
QuoteRef: liT2_2009 ;;Li, T. et al., Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
QuoteRef: liW4_2010 ;;Li, W., Zhang, Y., An efficient code update scheme for DSP applications in mobile embedded systems
QuoteRef: lianD6_2000 ;;Liang, D., Harrold, M.J., Light-weight context recovery for efficient and accurate program analyses
QuoteRef: lianS10_1998 ;;Liang, S., Bracha, G., Dynamic class loading in the Java virtual machine
QuoteRef: liblB6_2003 ;;Liblit, B. et al., Bug isolation via remote program sampling
QuoteRef: liebH11_1986 ;;Lieberman, H., Using prototypical objects to implement shared behavior in object oriented systems
QuoteRef: lienBP6_1978 ;;Lientz, B.P. et al., Chacteristics of application software maintenance
QuoteRef: liffJ2_2013 ;;Lifflander, J. et al., Adoption protocols for fanout-optimal fault-tolerant termination detection
QuoteRef: liliY10_2019 ;;Lilis, Y., Savidis, A., A survey of metaprogramming languages [NewQuotes]
QuoteRef: limTF3_1999 ;;Lim, T.F. et al., A memory-efficient real-time non-copying garbage collector
QuoteRef: limoTA6_2018 ;;Limoncelli, T.A., Documentation is automation [NewQuotes]
QuoteRef: linCY3_2007 ;;Lin, C.-Y., Hou, T.-W., A simple and efficient algorithm for cycle collection
QuoteRef: linMC8_2004 ;;Lin, M.C. et al., Physically based virtual painting
QuoteRef: linY6_2015 ;;Lin, Y. et al., Stop and go: understanding yieldpoint behavior
QuoteRef: linsC7_1990 ;;Lins, C., Programming without enumerations in Oberon
QuoteRef: linsL10_2017 ;;Linsbauer, L. et al., A classification of variation control systems [NewQuotes]
QuoteRef: lippM6_2020 ;;Lipp, M. et al., Meltdown: reading kernel memory from user space [NewQuotes]
QuoteRef: liptRJ12_1975 ;;Lipton, R.J., Reduction: a method of proving programs of parallel programs
QuoteRef: liskB4_1974 ;;Liskov, B., Programming with abstract data types
QuoteRef: liskB10_1981 ;;Liskov, B., Report on the Workshop on Fundamental Issues in Distributed Computing
QuoteRef: liskB_1996 ;;Liskov, B., A history of CLU, with transcript of presentation
QuoteRef: littB11_1993 ;;Littlewood, B., Strigini, L., Validation of ultrahigh dependability for software-based systems
QuoteRef: litwW10_1980 ;;Litwin, W., Linear hashing : a new tool for file and table addressing
QuoteRef: liuA11_2014 ;;Liu, A., JavaScript and the Netflix user interface
QuoteRef: liuBL3_2019 ;;Liu, B.L. et al., Rethinking incremental and parallel pointer analysis [NewQuotes]
QuoteRef: liuH6_2018 ;;Liu, H. et al., iReplayer: in-situ and identical record-and-replay for multithreaded applications [NewQuotes]
QuoteRef: liuJ1_2006 ;;Liu, J. et al., Interruptible iterators
QuoteRef: liuL8_2021 ;;Liu, L. et al., Safe-by-default concurrency for modern programming languages [NewQuotes]
QuoteRef: liuP6_2015 ;;Liu, P. et al., Light: replay via tightly bounded recording
QuoteRef: liuYA1_2000 ;;Liu, Y.A., Stoller, S.D., From recursion to iteration: what are the optimizations
QuoteRef: liuYA8_2009 ;;Liu, Y.A., Stoller, S.D., From Datalog rules to efficient programs with time and space guarantees
QuoteRef: liuYA10_2012 ;;Liu, Y.A. et al., From clarity to efficiency for distributed algorithms
QuoteRef: liuZ6_2017 ;;Liu, Z., Criswell, J., Flexible and efficient memory object metadata [NewQuotes]
QuoteRef: ljunS2_1988 ;;Ljungkvist, S., Letter to the editor
QuoteRef: lloyW5_2014 ;;Lloyd, W. et al., Don't settle for eventual consistency
QuoteRef: lockD7_2018 ;;Locke, D., Zuccon, G., A test collection for evaluating legal case law search [NewQuotes]
QuoteRef: logrL7_2016 ;;Logrippo, L., Causality in Computer Science (Letter to the editor)
QuoteRef: loitF6_2010 ;;Loitsch, F., Printing floating-point numbers quickly and accurately with integers
QuoteRef: lomeD6_1989 ;;Lomet, D., Salzberg, B., Access methods for multiversion data
QuoteRef: longAC5_1999 ;;Long, A.C., Jr. et al., Implications for a gesture design tool
QuoteRef: longAC4_2000 ;;Long. A.C. Jr. et al., Visual similarity of pen gestures
QuoteRef: lopeA8_2008 ;;Lopez, A., Statistical machine translation
QuoteRef: lopeCV12_2003 ;;Lopes, C.V. et al., Beyond AOP: Toward naturalistic programming
QuoteRef: lopeNP2_2018 ;;Lopes, N.P. et al., Practical verification of peephole optimizations with Alive [NewQuotes]
QuoteRef: louiRP8_1996 ;;Loui, R.P., Why GAWK for AI?
QuoteRef: lowJR5_1978 ;;Low, J.R., Automatic data structure selection: an example and overview
QuoteRef: loweDE10_1997 ;;Lowell, D.E., Chen, P.M., Free transactions with Rio Vista
QuoteRef: lozaRC6_2014 ;;Lozano, R. C. et al., Combinatorial spill code optimization and ultimate coalescing
QuoteRef: lozaRC6_2019 ;;Lozano, R.C., Schulte, C., Survey on combinatorial register allocation and instruction scheduling [NewQuotes]
QuoteRef: luJ6_2019 ;;Lu, J., Holubova, I., Multi-model databases: a new journey to handle the variety of data [NewQuotes]
QuoteRef: luL1_2014 ;;Lu, L. et al., A study of Linux file system evolution
QuoteRef: luS3_2008 ;;Lu, S. et al., Learning from mistakes -- A comprehensive study on real world concurrency bug characteristics
QuoteRef: lubkD6_1991 ;;Lubkin, D., Heterogeneous configuration management with DSEE
QuoteRef: lublR1_2009 ;;Lublinerman, R. et al., Modular code generation form synchronous block diagrams. Modularity vs. code size
QuoteRef: lublR10_2011 ;;Lublinerman, R. et al., Delegated isolation
QuoteRef: luccS6_2000 ;;Lucco, S., Split-stream dictionary program compression
QuoteRef: luciB6_2010 ;;Lucia, B. et al., Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races
QuoteRef: luenEA5_2021 ;;Luengo, E.A., Villalba, L.J.G., Recommendations on statistical randomness test batteries for cryptographic purposes [NewQuotes]
QuoteRef: lumVY4_1971 ;;Lum, V.Y. et al., Key-to-address transform techniques: a fundamental performance study on large existing formatted files
QuoteRef: lvinVB3_2008 ;;Lvin, V.B. et al., Archipelago: trading address space for reliability and security

Related up

Topic: ACM references
ThesaHelp: ACM references a-e
ThesaHelp: ACM references f-l
ThesaHelp: ACM references m-z

Updated barberCB 4/23
Copyright © 2002-2023 by C.B. Barber
Thesa, Avev, and thid-... are trademarks of C.B. Barber