ThesaHelp: references i-l

topic root > Group: all references

all references
references a-b
references c-d
references e-f
references g-h
references m-o
references p-r
references sa-sz
references t-z

all Thesa topics


Quotation references starting with 'i', 'j', 'k', or 'l'.

Group members up

QuoteRef: ibm_1982 ;;no author, IBM ad
QuoteRef: ichbJD_1972 ;;Ichbiah, J.D., Morse, S.P., General concepts of the Simula 67 programming language
QuoteRef: ichbJD_1973 ;;Ichbiah, J.D. et al., The two-level approach to data independence programming in the LIS system implementation language
QuoteRef: ieruR6_1996 ;;Ierusalimschy, R. et al., Lua -- an extensible extension language
QuoteRef: ieruR7_2005 ;;Ierusalimschy, R. et al., The implementation of Lua 5.0
QuoteRef: ieruR7_2011 ;;Ierusalimschy, R. et al., Passing a language through the eye of a needle
QuoteRef: ifraG_1994 ;;Ifrah, G., Histoire universelle des chiffres
QuoteRef: ifraG_2000 ;;Ifrah, G., The Universal History of Numbers
QuoteRef: ifraG_2001 ;;Ifrah, G., The Universal History of Computing : from the abacus to the quantum computer
QuoteRef: ignaS10_1998 ;;Ignatchenko, S., An algorithm for online data compression
QuoteRef: ilifJK10_1962 ;;Iliffe, J.K., Jodeit, J.G., A dynamic storage allocation scheme
QuoteRef: ilyaIF10_2008 ;;Ilyas, I.F. et al., A survey of top-k query processing techniques in relational database systems
QuoteRef: induB3_1986 ;;Indurkhya, B. et al., Optimal partitioning of randomly generated distributed programs
QuoteRef: ingaD10_1997 ;;Ingalls, D. et al., Back to the future. The story of Squeak, a practical Smalltalk written in itself
QuoteRef: ingaDH8_1981 ;;Ingalls, D.H.H., The Smalltalk graphics kernel
QuoteRef: ingaDH8_1981a ;;Ingalls, D.H.H., Design principles behind Smalltalk
QuoteRef: ingaDH9_1982 ;;Ingalls, D.H.H., Why operating systems may disappear
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: inouH_1984 ;;Inoue, H., Inaba, M., Hand-eye coordination in rope handling
QuoteRef: instrumentcontrol ;;no author, Instrument and Control Systems
QuoteRef: ironET1_1969 ;;Irons, E.T., Experience with an extensible language
QuoteRef: ishiK10_2000 ;;Ishizaki, K. et al., A study of devirtualization techniques for a Java just-in-time compiler
QuoteRef: isidS_600 ;;Isidore of Seville, The Quadrivium [NewQuotes]
QuoteRef: israC6_2015 ;;Isradisaikul, C., Myers, A.C., Finding counterexamples from parsing conflicts
QuoteRef: isreJW6_2012 ;;Israel, J.W., Why the FBI can't build a case management system
QuoteRef: itohH9_1999 ;;Itoh, H., Tanaka, H., An efficient method for in memory construction of suffix arrays
QuoteRef: ivanD10_2017 ;;Ivanchykhin, D. et al., Regular and almost universal hashing: an efficient implementation [NewQuotes]
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: jackD10_2002 ;;Jackson, D., Module dependencies in software design
QuoteRef: jackD_2012 ;;Jackson, D., Software Abstractions: Logic, Language, and Analysis
QuoteRef: jackMA_1975 ;;Jackson, M.A., Principles of Program Design
QuoteRef: jackMA5_1976 ;;Jackson, M.A., Information systems: modeling, sequencing and transformations
QuoteRef: jackMA_1977 ;;Jackson, M.A., The Jackson design methodology
QuoteRef: jackMA2_1984 ;;Jackson, M.A., Software composition
QuoteRef: jacoA8_2009 ;;Jacobs, A., The pathologies of big data
QuoteRef: jacoRJ4_1990 ;;Jacob, R.J.K., What you look at is what you get: Eye movement-based interaction techniques
QuoteRef: jacoSC4_1986 ;;Jacobsen, S.C. et al., Design of the UTAH/M.I.T. dextrous hand
QuoteRef: jaesG12_1981 ;;Jaeschke, G., Reciprocal hashing: A method for generating minimal perfect hashing functions
QuoteRef: jagaHV11_1999 ;;Jagadish, H.V. et al., Hierarchical or relational? A case for a modern hierarchical data model
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: jakiSL_1969 ;;Jaki, S.L., Brain, Mind and Computers
QuoteRef: jakoM11_2001 ;;Jakobsson, M., Reiter, M.K., Discouraging software piracy using software aging
QuoteRef: jakoM5_2019 ;;Jakobsson, M., The rising thread of launchpad attacks [NewQuotes]
QuoteRef: jameJS9_1978 ;;James, J.S., FORTH for microcomputers
QuoteRef: jameW_1890 ;;James, W., The Principles of Psychology [OK]
QuoteRef: jansBJ1_1998 ;;Jansen, B.J. et al., Real life information retrieval: a study of user queries on the web
QuoteRef: jansP9_1995 ;;Janson, P., Tsudik, G., Secure and minimal protocols for authenticated key distribution
QuoteRef: jansP4_1997 ;;Janson, P. et al., Scalability and flexibility in authentication services: the KryptoKnight approach
QuoteRef: jardDA5_1981 ;;Jardine, D.A., Davis, B.J., A data-base application design language
QuoteRef: jazeJM7_2001 ;;Jezequel, J.-M. et al., Reliable objects: lightweight testing for OO languages
QuoteRef: jeffDR7_1985 ;;Jefferson, D.R., Virtual time
QuoteRef: jeffDR5_1993 ;;Jeffery, D.R. et al., A comparison of function point counting techniques
QuoteRef: jenaSK3_1999 ;;Jena, S.K., An improved Lempel-Ziv algorithm for sequential data compression
QuoteRef: jeniJC2_2011 ;;Jenista, J.C. et al., OoOJava: Software Out-of-Order Execution
QuoteRef: jenkB9_1997 ;;Jenkins, B., Hash functions
QuoteRef: jenkRJ2_1996 ;;Jenkins, R.J., ISAAC
QuoteRef: jensC4_2000 ;;Jensen, C. et al., The effect of communication modality on cooperation in online environments
QuoteRef: jevoWS_1869 ;;Jevons, W.S., The Substitution of Similars, The true principle of reasoning, derived from a modification of Aristotle's dictum [OK NewQuotes]
QuoteRef: jevoWS_1870 ;;Jevons, W.S., Elementary Lessons in Logic: Deductive and Inductive, with copious questions and examples, and a vocabulary of logical terms
QuoteRef: jevoWS_1887 ;;Jevons, W.S., The Principles of Science: A treatise on logic and scientific method [OK NewQuotes]
QuoteRef: jianL5_2006 ;;Jiang, L., Su, Z., Osprey: a practical type system for validating dimensional unit correctness of C programs
QuoteRef: jimT5_2000 ;;Jim, T., SD3: a trust management system with certified evaluation
QuoteRef: jimT6_2002 ;;Jim, T. et al., Cyclone: A safe dialect of C
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: jiroM5_2006 ;;Jirotka, M., Luff, P., Supporting requirements with video-based analysis
QuoteRef: joacT8_2007 ;;Joachims, T., Radlinski, F., Search engines that learn from implicit feedback
QuoteRef: johnB9_2009 ;;Johnson, B., Reveling in constraints
QuoteRef: johnD_750 ;;St. John of Damascus, Fount of Knowledge
QuoteRef: johnJ9_1989 ;;Johnson, J. et al., The Xerox Star: A retrospective
QuoteRef: johnJ_2000 ;;Johnson, J., GUI Bloopers. Don'ts and Do's for Software Developers and Web Designers
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: johnPM3_1998 ;;Johnson, P.M., Tjahjono, D., Does every inspection really need a meeting?
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: johnS_1159 ;;John of Salisbury, Metalogicon [NewQuotes]
QuoteRef: johnS_1250 ;;John of Sacrobosco, Algorismus Vulgaris [NewQuotes]
QuoteRef: johnS_1747 ;;Johnson, S., The plan of an English dictionary, submitted to the right honourable Phillip Dormer, Earl of Chesterfield [OK]
QuoteRef: johnS_1755 ;;Johnson, S., L.L.D., A Dictionary of the English Language in which the words are deduced from their origin and illustrated in their different significations by examples from the best writers [OK]
QuoteRef: johnSC7_1978a ;;Johnson, S.C., Ritchie, D.M., Portability of C programs and the UNIX system
QuoteRef: johnSC7_1978b ;;Johnson, S.C., Lesk, M.E., UNIX time-sharing system: Language development tools
QuoteRef: joisPG3_2008 ;;Joisha, P.G., A principled approach to nondeferred reference-counting garbage collection
QuoteRef: joisPG6_2014 ;;Joisha, P.G., Sticky tries: Fast insertions, fast lookups, no deletions for large key universes
QuoteRef: joneAK4_1976 ;;Jones, A.K., Liskov, B.H., An access control facility for programming languages
QuoteRef: joneAK5_1978 ;;Jones, A.K., A language extension for expressing constraints on data access
QuoteRef: joneR_1996 ;;Jones, R., Lins, R., Garbage collection: algorithms for automatic dynamic memory management
QuoteRef: joneSL2_1986 ;;Jones, S.L.P., Parsing distfix operators
QuoteRef: joneSP9_1999 ;;Jones, S.P. et al., C--: a portable assembly language that supports garbage collection
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: joneTC1_1977 ;;Jones, T.C., Program quality and programmer productivity
QuoteRef: joneTC6_1977 ;;Jones, T.C., Psychology, Linguistics, and Physics in Northern India and China from the 6th century B.C. to the 9th century A.D.
QuoteRef: joneTC4_1979 ;;Jones, T.C., A survey of programming design and specification techniques
QuoteRef: joneTC4_1979a ;;Jones, T.C., An overview of programming architectures and design languages
QuoteRef: joneTC4_1979b ;;Jones, T.C., An overview of programming architectures and design languages
QuoteRef: joneTC8_1981 ;;Jones, T.C., Alternatives to programming
QuoteRef: joneWP1_1986 ;;Jones, W.P., Dumais, S.T., The spatial metaphor for user interfaces: Experimental tests of reference by location versus name
QuoteRef: joneWP9_1987 ;;Jones, W.P., How do we distinguish the hyper from the hype in non-linear-text
QuoteRef: jonesTC12_1981 ;;Jones, T.C., Defect removal: A look at the state of the art
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: jordWC_1996 ;;Jordan, W.C., The Great Famine: Northern Europe in the Early Fourteenth Century [NewQuotes]
QuoteRef: jorgM5_2008 ;;Jorgensen, M., Grimstad, S., Avoiding irrelevant and misleading information when estimating development effort
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: jpl3_2009 ;;Jet Propulsion Laboratory, California Institute of Technology, JPL institutional coding standard for the C programming language
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: kakaY9_1985 ;;Kakazu, Y. et al., A study on cooperative robot motion simulation
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: kanaM_2012 ;;Kanat-Alexander, M., Code Simplicity
QuoteRef: kandE3_1998 ;;Kandogan, E., Shneiderman, B., Elastic windows: design, implementation, and evaluation of multi-window operations
QuoteRef: kandS8_2009 ;;Kandula, S. et al., Detailed diagnosis in enterprise networks
QuoteRef: kaneU7_20 ;;Kanewala, U., Chen, T.Y., Metamorphic testing: a simple yet effective approach for testing scientific software [NewQuotes]
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: kantE7_1986 ;;Kantorowitz, E., Laor, H., Automatic generation of useful syntax error messages
QuoteRef: kantI_1781 ;;Kant, I., Critique of Pure Reason [OK]
QuoteRef: kanvV6_2016 ;;Kanvar, V., Khedker, U.P., Heap abstractions for static analysis
QuoteRef: kaplD_1968 ;;Kaplan, D., Quantifying in
QuoteRef: kaplSJ7_1990 ;;Kaplan, S.J. et al., Agenda: A personal information manager
QuoteRef: kapoAA1_1978 ;;Kaposi, A A, An algebra of algorithms and its application to program design and maintenance
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: kareR3_1994 ;;Karedla, R. et al., Caching strategies to improve disk system performance
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: kargPA6_1974 ;;Karger, P.A., Schell, R.R., Multics security evaluation: vulnerability analysis
QuoteRef: kargPA12_2002 ;;Karger, P.A., Schell, R.R., Thirty years later: Lessons from the Multics security evaluation
QuoteRef: kariRR7_1987 ;;Karinthi, R.R., Weiser, M., Incremental re-execution of programs
QuoteRef: karkJ11_2008 ;;Karkkainen, J., Rantala, T., Engineering radix sort for strings
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: kartU11_2017 ;;Kartoun, U., Text nailing: an efficient human-in-the-loop text-processing method
QuoteRef: karyG8_1999 ;;Karypis, G. et al., Chameleon: hierarchical clustering using dynamic modeling
QuoteRef: kastU_1980 ;;Kastens, U., Ordered Attributed grammars
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: katzJ5_1979 ;;Katzenelson, J., Clusters and dialogues for set implementations
QuoteRef: katzJH_1963 ;;Katz, J.H., McGee, W.C., An experiment in non-procedural programming
QuoteRef: katzJJ_1981 ;;Katz, J.J., Language and other abstract objects [NewQuotes]
QuoteRef: katzL_1981 ;;Katzschner, L., Van den Brande, F., ITT 1240 Digital Exchange, Software concepts and implementation
QuoteRef: katzN1_1972 ;;Katzman, N., Nyenhuis, J., Color vs. Blank-and-white effects on learning, opinion, and attention
QuoteRef: kaufW_1980 ;;Kaufmann, W., Discovering the mind, Volume two, Nietzsche, Heidegger, and Buber
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_1977 ;;Kay, A., Goldberg, A., Personal dynamic media
QuoteRef: kayA3_1993 ;;Kay, A., The history of Smalltalk
QuoteRef: kayAC6_1968 ;;Kay, A.C., Flex--a flexible extendable language
QuoteRef: kayAC_1996 ;;Kay, A.C., The early history of Smalltalk, with transcript of presentation
QuoteRef: kayJ_2015 ;;Kay, J., Other People's Money: the real business of finance [NewQuotes]
QuoteRef: kearM10_2012 ;;Kearns, M., Experiments in social computation
QuoteRef: kediP6_2017 ;;Kedia, P. et al., Simple, fast, and safe manual memory management
QuoteRef: keizG6_1993 ;;Keizer, G., ClarisWorks has a document approach
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: kellT12_2009 ;;Kelly, T. et al., Eliminating concurrency bugs with control engineering
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: kentJ8_1988 ;;Kent, J. et al., Browsing Electronic Mail: Experiences interfacing a mail system to a DBMS
QuoteRef: kentW_1978 ;;Kent, W., Data and reality
QuoteRef: kentW_1978x ;;Kent, W., Data and reality
QuoteRef: kentW1_1984 ;;Kent, W., Fact-based data analysis and design
QuoteRef: kentW1_1985 ;;Kent, W., The realities of Data: Basic properties of data reconsidered
QuoteRef: kentW2_1989 ;;Kent, W., The many forms of a single fact
QuoteRef: kentW6_1991 ;;Kent, W., A rigorous model of object reference, identity, and existence
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: kernBW_1973 ;;Kernighan, B.W., Plauger, P.J., Programming style for programmers and language designers
QuoteRef: kernBW_1975 ;;Kernighan, B.W., Plauger, P.J., Software tools
QuoteRef: kernBW9_1978 ;;Kernighan, B.W., UNIX for beginners -- Second edition
QuoteRef: kernBW1_1979 ;;Kernighan, B.W., Mashey, J.R., The UNIX programming environment
QuoteRef: kernBW7_1998 ;;Kernighan, B.W., van Wyk, C.J., Timing trials, or the trials of timing: Experiments with scripting and user-interface languages
QuoteRef: kerrST_1986 ;;Kerr, S.T., Transition for page to screen
QuoteRef: keslTE11_1984 ;;Kesler, T.E., et al, The effect of indentation on program comprehension
QuoteRef: kessPB6_1990 ;;Kessler, P.B., Fast breakpoints: design and implementation
QuoteRef: kettL5_2008 ;;Kettner, L. et al., Classroom examples of robustness problems in geometric computations [NewQuotes]
QuoteRef: keynJM_1921 ;;Keynes, J.M., A Treatise on Probability [OK NewQuotes]
QuoteRef: khanAA8_2003 ;;Khanban, A.A., Edalat, A., Computing Delaunay triangulation with imprecise input data
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: kherL9_1978 ;;Kheriaty, L., WADUZITDO: How to write a language in 256 words or less
QuoteRef: kiebRB9_1973 ;;Kieburtz, R.B., Syntax macros and the elaboration of data structures
QuoteRef: kietP7_2021 ;;Kietzmann, P. et al., A guideline on pseudorandom number generation (PRNG) in the IoT [NewQuotes]
QuoteRef: kigeJI2_1984 ;;Kiger, J.I., The depth/breadth trade-off in the design of menu-driven user interfaces
QuoteRef: kilgFG4_1997 ;;Kilgour, F.G., Origins of coordinate searching
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: kimPC12_1995 ;;Kim, P.-C. et al., Extendible chained bucket hashing for main memory databases
QuoteRef: kimS_1999 ;;Kim, S., A new string-pattern matching algorithm using partitioning and hashing efficiently
QuoteRef: kimSJ3_2002 ;;Kim, S.J., Lee, S.H., An improved computation of the PageRank algorithm
QuoteRef: kimW12_1991 ;;Kim, W., Seo, J., Classifying schematic and data heterogeneity in multidatabase systems
QuoteRef: kimuTD7_1985 ;;Kimura, T.D. et al., A design of a data model based on abstraction of symbols
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: kirsPA4_2006 ;;Kirschner, P.A. et al., Why minimal guidance during instruction does not work: An analysis of the failure of constructivist, discovery, problem-based, experiential, and inquiry-based teaching
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: kjelM1_1998 ;;Kjelso, M. et al., Empirical study of memory-data: characteristics and compressibility
QuoteRef: kleeSC_1956 ;;Shannon, C.E., McCarthy, J., Representation of events in nerve nets and finite automata
QuoteRef: kleiDV5_1991 ;;Klein,D.V., Foiling the cracker: A survey of, and improvements to, password security
QuoteRef: kleiG11_2001 ;;Klein, G., Nipkow, T., Verified lightweight bytecode verification
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: kleiMH1_1994 ;;Klein, M.H. et al., Rate-monotonic analysis for real-time industrial computing
QuoteRef: kleiST7_1989 ;;Klein, S.T. et al., Storing text retrieval systems on CD-ROM: Compression and encryption considerations
QuoteRef: klemB_2009 ;;Klemens, B., Modeling with data: tools and techniques for scientific computing [NewQuotes]
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: klinV_2012 ;;Klinkenborg, V., Several Short Sentences about Writing
QuoteRef: klonY6_2014 ;;Klonatos, Y. et al., Building efficient query engines in a high-level language
QuoteRef: knieG5_2001 ;;Kneisel, G., Theisen, D., JAC--Access right based encapsulation for Java
QuoteRef: knigJC1_1986 ;;Knight, J.C., Leveson, N.G., An experimental evaluation of the assumption of independence in multiversion programming
QuoteRef: knigK11_1990 ;;Knight, K., Connectionist ideas and algorithms
QuoteRef: knobB4_1976 ;;Knobe, B., Yuval, G., Some steps towards a better Pascal
QuoteRef: knobK9_1981 ;;Knobe, K., Early Experience with MONSTRtm: A software maintenance management tool
QuoteRef: knooJ6_1992 ;;Knoop, J. et al., Lazy code motion
QuoteRef: knooJ5_1995 ;;Knoop, J. et al., Parallelism for free: bitvector analyses => no state explosion!
QuoteRef: knooJ3_1998 ;;Knoop, J. et al., Basic-block graphs: Living dinosaurs?
QuoteRef: knowD_1962 ;;Knowles, D., The Evolution of Medieval Thought [NewQuotes]
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: knudDB_1976 ;;Knudsen, D.B. et al., A modification request control system
QuoteRef: knutDE4_1961 ;;Knuth, D.E., Minimizing drum latency time
QuoteRef: knutDE6_1965 ;;Knuth, D.E., On the translation of languages from left to right
QuoteRef: knutDE6_1968 ;;Knuth, D.E., Semantics of context free languages
QuoteRef: knutDE12_1970 ;;Knuth, D. E., Von Neumann's first computer program
QuoteRef: knutDE1_1971 ;;Knuth, D.E., An empirical study of FORTRAN programming
QuoteRef: knutDE7_1972 ;;Knuth, D.E., Ancient Babylonian algorithms
QuoteRef: knutDE_1973 ;;Knuth, D.E., The Art of Computer Programming
QuoteRef: knutDE4_1976 ;;Knuth, D.E., Big omicron and big omega and big theta
QuoteRef: knutDE8_1976 ;;Knuth, D.E., Pardo, L.T., The early development of programming languages
QuoteRef: knutDE_1977 ;;Knuth, D.E., Structured programming with goto statements
QuoteRef: knutDE4_1977 ;;Knuth, D.E., Algorithms
QuoteRef: knutDE9_1979 ;;Knuth, D.E., Algorithms in modern mathematics and computer science
QuoteRef: knutDE11_1981 ;;Knuth, D.E., Plass, M.F., Breaking paragraphs into lines
QuoteRef: knutDE2_1984 ;;Knuth, D.E., Literate Programming
QuoteRef: knutDE10_1985 ;;Knuth, D.E., Theory and Practice, II
QuoteRef: knutDE7_1989 ;;Knuth, D.E., The errors of TEX
QuoteRef: koAJ4_2004 ;;Ko, A.J., Myers, B.A., Designing the Whyline: A debugging interface for asking questions about program behavior
QuoteRef: koAJ12_2006 ;;Ko, A.J. et al., An exploratory study of how developers seek, relate, and collect relevant information during software maintenance tasks
QuoteRef: kochM_1967 ;;Kochen, M., The Growth of Knowledge
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: koenA_1990 ;;Koenig, A., Stroustrup, B., Exception handling for C++
QuoteRef: koenA12_1995 ;;Koenig, A., Stroustrup, B., Foundations for native C++ styles
QuoteRef: kohnLM5_1978 ;;Kohnfelder, L.M., Towards a practical public-key cryptosystem
QuoteRef: kohnM9_1986 ;;Kohno, M. et al., Real time synchronization of two robots for coordinated assembly
QuoteRef: konoK4_2000 ;;Kono, K., Masuda, T., Efficient RMI: dynamic specialization of object serialization
QuoteRef: kopeH1_1994 ;;Kopetz, H., Grunsteidl, G., TTP-A protocol for fault-tolerant real-time systems
QuoteRef: koreY8_2009 ;;Koren, Y. et al., Matrix factorization techniques for recommender systems
QuoteRef: kornGA_1978 ;;Korn, G.A., Closing the software gap for interactive mini/microcomputation: Direct execution of microprogrammed block-diagram primitives
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: kostCH_1974 ;;Koster, C.H.A., Using the CDL compiler-compiler
QuoteRef: kostCH_1974a ;;Koster, C.H.A., Two-level grammers
QuoteRef: kosyDK_1973 ;;Kosy, D.K., Approaches to improved program validation through programming language design
QuoteRef: kotlP4_1972 ;;Kotler, P., A generic concept of marketing
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: kowaR11_1973 ;;Kowalski, R., Predicate logic as programming language
QuoteRef: koyrA_1957 ;;Coyer, A., From the Closed World to the Infinite Universe
QuoteRef: kralTM5_1975 ;;Kraly, T.M. et al., Program design study
QuoteRef: kramS2_1996 ;;Kramer, S., Mind, symbolism, formalism: is Leibniz a precursor of artificial intelligence?
QuoteRef: krasG8_1981 ;;Krasner, G., The Smalltalk-80 virtual machine
QuoteRef: krasH10_1994 ;;Krasner, H. et al., A case history of the space shuttle onboard systems project
QuoteRef: kripS11_1975 ;;Kripke, S., Outline of a theory of truth
QuoteRef: kripS11_1997 ;;Kripke, S., Logicism, Wittgenstein, and the identification of numbers
QuoteRef: kripSA3_1959 ;;Kripke, S.A., A completeness theorem in modal logic
QuoteRef: kripSA_1980 ;;Kripke, S.A., Naming and Necessity
QuoteRef: kripSA_1982 ;;Kripke, S.A., Wittgenstein on Rules and Private Language
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: krivN10_1999 ;;Krivokapic, N. et al., Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis
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: krugS_2006 ;;Krug, S., Don't Make Me Think! A common sense approach to web usability
QuoteRef: ksheAD1_1994 ;;Kshemkalyani, A.D., Singhal, M., Efficient detection and resolution of generalized distributed deadlocks
QuoteRef: ksheN9_2020 ;;Kshetri, N., DeFranco, J.F., The economics of cyberattacks on Brazil [NewQuotes]
QuoteRef: kugeP9_1979 ;;Kugel, P., The controversy goes on--"Can computers think?" Part II: What is thinking?
QuoteRef: kuhnDR4_1997 ;;Kuhn, D.R., Sources of failure in the public switched telephone network
QuoteRef: kuhnF9_2008 ;;Kuhn, F. et al., Distributed selection: a missing piece of data aggregation
QuoteRef: kuhnTS_1970 ;;Kuhn, Thomas S., The structure of scientific revolutions 2nd edition
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: kuniP_2003 ;;Kunizsch, P., The transmission of Hindu-Arabic numerals reconsidered [NewQuotes]
QuoteRef: kurtS11_1999 ;;Kurtz, S., Reducing the space requirements of suffix trees
QuoteRef: kurtTE5_1964 ;;Krutz, T.E. et al., BASIC Beginner's All-purpose Symbolic Instruction Code
QuoteRef: kuznOP6_1972 ;;Kuznetsov, O.P. et al., Yarus--a language for describing the operation of complex automata
QuoteRef: kwokYK12_1999 ;;Kwok, Y.-K., Ahmad, I., Static scheduling algorithms for allocating directed task graphs to multiprocessors
QuoteRef: labbK_1000 ;;Labban, K. ibn, Kitab fi usul hisab al-hind [ExtraQuote]
QuoteRef: labkC3_1998 ;;Lapkowski, C., Hendren, L.J., Extended SSA numbering: introducing SSA properties to languages with multi-level pointers
QuoteRef: lacyJB10_1993 ;;Lacy, J.B. et al., CryptoLib: Cryptography in software
QuoteRef: lafoF3_1984 ;;Lafora, F., Soffa, M.L., Reverse execution in a generalized control regime
QuoteRef: laiKY10_1988 ;;Lai, K.-Y. et al., Object Lens: a "spreadsheet" for coooperative work
QuoteRef: lakaI_1970 ;;Lakatos, I., Falsification and the methodology of scientific research programmes
QuoteRef: lakaI_1976 ;;Lakatos, I., Proofs and refutations. The logic of mathematical discovery
QuoteRef: lakoG_1987 ;;Lakoff, G., Women, Fire and Dangerous Things, What categories reveal about the mind
QuoteRef: lambM3_2002 ;;Lambuth, M., Bug fishing
QuoteRef: lambS_1986 ;;Lamb, S., Lamb, S., What is a language
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: lampBW_1971 ;;Lampson, B.W., On reliable and extendable operating systems
QuoteRef: lampBW3_1971 ;;Lampson, B.W., Protection
QuoteRef: lampBW_1974 ;;Lampson, B.W. et al., On the transfer of control between contexts
QuoteRef: lampBW4_1974 ;;Lampson, B.W., An open operating system for a single-user machine
QuoteRef: lampBW2_1980 ;;Lampson, B.W., Redell, D.D., Experience with processes and monitors in Mesa
QuoteRef: lampBW_1981 ;;Lampson, B.W., Atomic transactions
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: lampBW6_2004 ;;Lampson, B.W., Computer security in the real world
QuoteRef: lampL1_1976 ;;Lamport, L., The synchronization of independent processes
QuoteRef: lampL7_1978 ;;Lamport, L., Time, clocks, and the ordering of events in a distributed system
QuoteRef: lampL_1980 ;;Lamport, L., The 'Hoare Logic' of concurrent programs
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
QuoteRef: lampL5_1998 ;;Lamport, L., The part-time parliament
QuoteRef: lampL_2003 ;;Lamport, L., Specifying Systems : The TLA+ Language and Tools for Hardware and Software Engineers
QuoteRef: lampL7_2004 ;;Lamport, L., Lower bounds for asynchronous consensus [ExtraQuote]
QuoteRef: lampL8_2005 ;;Lamport, L., Real time is really simple
QuoteRef: lampL_2008 ;;Lamport, L., The specification language TLA+ [NewQuotes]
QuoteRef: lampL4_2008 ;;Lamport, L., Computation and state machines
QuoteRef: lampL11_2011 ;;Lamport, L., How to write a 21st century proof
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: landGP11_1987 ;;Landow, G.P., Relationally encoded links and the rhetoric of hypertext
QuoteRef: landPJ1_1964 ;;Landin, P.J., The mechanical evaluation of expressions
QuoteRef: landPJ2_1965 ;;Landin, P.J., A correspondence between ALGOL 60 and Church's lambda-notation: Part 1
QuoteRef: landPJ_1966 ;;Landin, P.J., A .lambda.-calculus approach
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: langDT_1984 ;;Langendoen, D.T., Postal, P.M., The Vastness of Natural Languages [NewQuotes]
QuoteRef: laniJH1_1954 ;;Laning, J.H. Jr., Zierler, N., A program for translation of mathematical equations for Whirlwind I
QuoteRef: laplP9_2020 ;;Laplante, P., A brief history of software professionalism and the way forward [NewQuotes]
QuoteRef: laplPS_1799 ;;Laplace, P.-S., Traite de Mecanique Celeste (Celestial Mechanics) [OK]
QuoteRef: laplPS_1824 ;;Laplace, P.S., Exposition du systeme du monde [OK]
QuoteRef: laplPS_1825 ;;Laplace, P.-S.], Essai Philosophique sur les Probabilites [NewQuotes]
QuoteRef: larmJ9_1978 ;;Larmouth, J., Scheduling for immediate turnaround
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: laruJR5_2004 ;;Larus, J.R. et al., Righting software
QuoteRef: lattC4_2003 ;;Lattner, C., Adve, V., Data structure analysis: a fast and scalable context-sensitive heap analysis
QuoteRef: lattC3_2004 ;;Lattner, C., Adve, V., LLVM: A compilation framework for lifelong program analysis & transformation
QuoteRef: lattC6_2007 ;;Lattner, C. et al., Making context-sensitive points-to analysis with heap cloning practical for the real world
QuoteRef: lattC6_2008 ;;Lattner, C., Adve, V., LLVM Language Reference Manual (version 2.3)
QuoteRef: lattC3_2020 ;;Lattner, C. et al., arXiv:2002.11054v2 [NewQuotes]
QuoteRef: laueHC_1979 ;;Lauer, H.C., Satterthwait, E.H., The impact of Mesa on system design
QuoteRef: lauePE_1979 ;;Lauer, P.E. et al., COSY--a system specification language based on paths and processes
QuoteRef: laueS7_2001 ;;Lauesen, S., Harning, M.B., Virtual windows: linking user tasks, data models, and interface design
QuoteRef: laurB_1991 ;;Laurel, B., Computers as Theatre
QuoteRef: laurB10_2014 ;;Laurie, B., Certificate transparency
QuoteRef: lautL6_1989 ;;Lauterbach, L., Randall, W., Experimental evaluation of six test techniques
QuoteRef: laviS_1994 ;;Lavine, S., Understanding the Infinite
QuoteRef: layzD12_1975 ;;Layzer, D., The arrow of time
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: leavBM4_1970 ;;Leavenworth, B.M., Towards an extensible language
QuoteRef: leavBM9_1970 ;;Leavenworth, B.M., Functional Data Structures
QuoteRef: leavBM7_1977 ;;Leavenworth, B.M., Structure debugging using a domain specific language
QuoteRef: leavGT2_1984 ;;Leavens, G.T., Prettyprinting styles for various languages.
QuoteRef: lebeR9_1994 ;;Leberknight, R., Ruffer, D., The essence of Forth ... is the relationship between programmer and source
QuoteRef: leblDB5_1984 ;;Leblang, D.B., Chase, R.P. Jr., Computer-aided software engineering in a distributed workstation environment
QuoteRef: leblDB11_1987 ;;Leblang, D.B., Chase, R.P., Jr., Parallel software configuration management in a network environment
QuoteRef: lechR_1973 ;;Lechner, R., Stallings, W., A minisystem programming language
QuoteRef: lecrT7_1995 ;;Lecroq, T., Experimental results on string matching algorithms
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: ledgH_1981 ;;Ledgard, H. et al., Directions in Human Factors for Interactive Systems
QuoteRef: ledgHF9_1971 ;;Ledgard, H.F., Ten mini-languages: a study of topical issues in programming languages
QuoteRef: ledgHF_1975 ;;Ledgard, H.F., Programming proverbs
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: ledgHF11_1980 ;;Ledgard, H.F. et al., An experiment on human engineering of interactive software
QuoteRef: leeBH1_1987 ;;Lee, B.H., Lee, C.S.G., Collision-free motion planning of two robots
QuoteRef: leeCS_1986 ;;Lee, C.S.G. et al., Tutorial on Robotics, 2nd edition
QuoteRef: leeD9_1997 ;;Lee, D. et al., Implementation and performance evaluation of the LRFU replacement policy
QuoteRef: leeE4_1993 ;;Lee, E., Whalen, T., Computer image retrieval by features: Suspect identification
QuoteRef: leeEA9_2000 ;;Lee, E.A., What's ahead for embedded software?
QuoteRef: leeEA5_2006 ;;Lee, E.A., The problem with threads
QuoteRef: leeEK12_2007 ;;Lee, E.K., Martel, C.U., When to use splay trees
QuoteRef: leeHT4_2008 ;;Lee, H.-T. et al., IRLbot: scaling to 6 billion pages and beyond
QuoteRef: leeI6_1993 ;;Lee, I., Iyer, R.K., Faults, symptoms, and software fault tolerance in the Tandem GUARDIAN90 operating system
QuoteRef: leeI6_1996 ;;Lee, I. et al., Efficient service of rediscovered software problems
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: leePJ1_1990 ;;Lee, P.J., Secure user access control for public networks
QuoteRef: leeW6_2016 ;;Lee, W. et al., Verifying bit-manipulations of floating-point
QuoteRef: leerP2_1976 ;;van Leer, P., Top-down development using a program design language
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: lefuC1_2000 ;;Lefurgy, C. et al., Reducing code size with run-time decompression
QuoteRef: lehmF12_1988 ;;Lehman, F., letter to the editor
QuoteRef: lehmMM9_1980 ;;Lehman, M.M., Programs, life cycles, and laws of software evolution
QuoteRef: lehmMM3_1981 ;;Lehman, M.M., On understanding laws, evolution, and conservation in the large-program life cycle
QuoteRef: lehmMM11_1982 ;;Lehman, M.M., Program evolution
QuoteRef: leibGW3_1603 ;;Leibnitz, G.W., Leibnitz's reply to the extract from the letter of M. Foucher, Canon of Dijon, published in the "Journal" of March 16, 1693 [NewQuotes]
QuoteRef: leibGW_1666 ;;Leibniz, G.W., Dissertatio de arte combinatoria [Dissertation on the art of combinations]
QuoteRef: leibGW_1670 ;;Leibniz, G.W., Elements of Natural Law
QuoteRef: leibGW_1679 ;;Leibniz, G.W., Philosophical Writings
QuoteRef: leibGW_1679a ;;Leibniz, G.W., On the general characteristic
QuoteRef: leibGW4_1679 ;;Leibniz, G.W., Elements of a Calculus
QuoteRef: leibGW9_1679 ;;Leibniz, G.W., letter to Huygens from Hannover (with enclosed essay) [NewQuotes]
QuoteRef: leibGW_1685 ;;von Leibniz, G.W., paper XX on calculus universalis
QuoteRef: leibGW_1686 ;;Leibniz, G.W., General investigation concerning the analysis of concepts and truths
QuoteRef: leibGW_1686b ;;Leibniz, G.W., Discourse on metaphysics
QuoteRef: leibGW_1686c ;;Leibniz, G.W., Correspondence with Arnauld
QuoteRef: leibGW4_1695 ;;Leibniz, G.W., Specimen dynamicum: An essay in dynamics, ...
QuoteRef: leibGW11_1696 ;;Leibniz, G.W., Extract from a letter written by Monsieur Leibniz about his philosophical hypothesis ("Third explanation of the new system")
QuoteRef: leibGW_1697 ;;Leibniz, G.W., Omnibus ex nihilo ...
QuoteRef: leibGW_1703 ;;Leibniz, G.W., Explanation of binary arithmetic
QuoteRef: leibGW_1705 ;;Leibnitz, G.W., Nouveaux Essais sur l'Endendement Humain [OK]
QuoteRef: leibGW5_1705 ;;Leibniz, G.W., letter to Basnage de Beauval [editor]
QuoteRef: leibGW_1714 ;;Leibniz, G.W., Principles of nature and grace, based on reason
QuoteRef: leibGW3_1714 ;;von Leibniz, G.W., letter to Pierre Remond de Montmort, March 14, 1714 [French]
QuoteRef: leibGW_1716 ;;Leibniz, G.W., Reply to the comments in the second edition of M. Bayle's Critical Dictionary ...
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: leisAC_1969 ;;Leisenring, A.C., Mathematical logic and Hilbert's .epsilon.-Symbol [NewQuotes]
QuoteRef: leitL11_2019 ;;Leite, L. et al., A survey of devops concepts and challenges [NewQuotes]
QuoteRef: lemiD1_2015 ;;Lemire, D., Boytsov, L., Decoding billions of integers per second through vectorization
QuoteRef: lemiD4_2018 ;;Lemire, D. et al., Roaring bitmaps: implementation of an optimized software library [NewQuotes]
QuoteRef: lenaDB10_1982 ;;Lenat, D.B., The nature of heuristics
QuoteRef: lenaDB3_1983 ;;Lenat, D.B., EURISKO: A program that leans new heuristics and domain concepts. The nature of heuristics III: Program design and results
QuoteRef: lenaDB8_1984 ;;Lenat, D.B., Brown, J.S., Why AM and EURISKO appear to work
QuoteRef: lenaDB1_1991 ;;Lenat, D.B., Feigenbaum, E.A., On the thresholds of knowledge
QuoteRef: lensAK9_2001 ;;Lenstra, A.K., Verheul, E.R., Selecting cryptographic key sizes
QuoteRef: leon_1202 ;;Leonardo of Pisa, also known as Fibonacci, Liber abaci
QuoteRef: leonAJ11_1971 ;;Leonard, A.J., Tribe, M.E., Notable features of Orion
QuoteRef: leonY12_2002 ;;Leontiev, Y. et al., On type systems for object-oriented database programming languages
QuoteRef: lernA9_2003 ;;Lerner, A., Shasha, D., AQuery: query language for ordered data, optimization techniques, and experiments
QuoteRef: leroX1_1998 ;;Leroy, X., Rouaix, F., Security properties of typed applets
QuoteRef: leroX1_2006 ;;Leroy, X., Formal certification of a compiler back-end, or: Programming a compiler with a proof assistant
QuoteRef: leroX7_2009 ;;Leroy, X., Formal verification of a realistic compiler
QuoteRef: leskM3_1988 ;;Lesk, M., GRAB--Inverted indexes with low storage overhead
QuoteRef: leuFC2_2000 ;;Leu, F.-C. et al., An efficient external sorting algorithm
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: leveNG4_1990 ;;Leveson, N.G. et al., The use of self checks and voting in software error detection: An empirical study
QuoteRef: leveNG7_1993 ;;Leveson, N.G., Turner, C.S., An investigation of the Therac-25 accidents
QuoteRef: leveNG_1995 ;;Leveson, N.G., Safeware : System Safety and Computers [NewQuotes]
QuoteRef: leviJ5_1980 ;;Levine, J., Why a lisp-based command language?
QuoteRef: leviP_2005 ;;Levis, P. et al., TinyOS: An operating system for sensor networks [ExtraQuote]
QuoteRef: leviP7_2008 ;;Levis, P. et al., The emergence of a networking primitive in wireless sensor networks
QuoteRef: leviT7_1960 ;;Levitt, T., Marketing Myopia
QuoteRef: levyEB11_1982 ;;Levy, E.B., The case against Pascal as a teaching tool
QuoteRef: levyS_1984 ;;Levy, S., Hackers. Heroes of the computer revolution
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: liJ12_2004 ;;Li, J. et al., Secure untrusted data repository (SUNDR)
QuoteRef: liJ3_2016 ;;Li, J. et al., Work stealing for interactive services to meet target latency
QuoteRef: liP12_2008 ;;Li, P. et al., One sketch for all: Theory and application of conditional random sampling
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: liZ3_2006 ;;Li, Z. et al., CP-Miner: finding copy-past and related bugs in large-scale software code
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: lickJC_1960 ;;Licklider, J.C.R., Man-computer symbiosis
QuoteRef: lickJC5_1962 ;;Licklider, J.C.R., Clark, W.E., On-line man-computer communication
QuoteRef: liddM12_2006 ;;Liddell, M., Moffat, A., Decoding prefix codes
QuoteRef: liebH11_1986 ;;Lieberman, H., Using prototypical objects to implement shared behavior in object oriented systems
QuoteRef: liebKJ9_1989 ;;Lieberherr, K.J., Holland, I.M., Assuring good style for object-oriented programs
QuoteRef: liebLI7_1977 ;;Lieberman, L.I., Wesley, M.A., AUTOPASS: An automatic programming system for computer controlled mechanical assembly
QuoteRef: liedJ1_1994 ;;Liedtke, J., A short note on implementing "new" machine instructions by software for efficient test of page accessibility
QuoteRef: liefH7_1999 ;;Liefke, H., Davidson, S.B., Specifying updates in biomedical databases
QuoteRef: lienBP6_1978 ;;Lientz, B.P. et al., Chacteristics of application software maintenance
QuoteRef: liewS11_2003 ;;Liewellyn, S., Such stuff as dreams are made on? Elaborative encoding, the ancient art of memory, and the hippocampus
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: linAD5_1963 ;;Lin, A.D., Key addressing of random access memories by radix transformation
QuoteRef: linCH1_1995 ;;Lin, C.H. et al., A new public-key cipher system based upon the Diophantine equations
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: linWC3_1979 ;;Lin, W.C. et al., Common properties of some multiattribute file systems
QuoteRef: linY6_2015 ;;Lin, Y. et al., Stop and go: understanding yieldpoint behavior
QuoteRef: lindC_1981 ;;Linden, C., Electronic seal--a new method to protect valuable data files
QuoteRef: lindC3_2004 ;;Lindig, C., Ramsey, N., Declarative composition of stack frames
QuoteRef: lindM_2004 ;;Linderman, M., Defensive design for the Web
QuoteRef: lindO_1992 ;;Linderholm, O., Mind Melding
QuoteRef: lindRK6_1993 ;;Lindsay, R.K. et al., DENDRAL: a case study of the first expert system for scientific hypothesis formation
QuoteRef: lingRC6_1975 ;;Linger, R.C., Mills, H.D., Definitional text in structured programming
QuoteRef: lingRC10_1988 ;;Linger, R.C., Mills, H.D., A case study in Cleanroom software engineering: The IBM COBOL structuring facility
QuoteRef: lingRC5_1993 ;;Linger, R.C., Cleanroom software engineering for zero-defect software
QuoteRef: linhA8_2000 ;;Linhares, A., A glimpse of the metaphysics of Bongard problems
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: linsRD12_1992 ;;Lins, R.D., Cyclic reference counting with lazy mark-scan
QuoteRef: lionJ_1977 ;;Lions, J., A Commentary on the Unix Operating System [NewQuotes]
QuoteRef: lippM6_2020 ;;Lipp, M. et al., Meltdown: reading kernel memory from user space [NewQuotes]
QuoteRef: lippSB_1996 ;;Lippman, S.B., Inside the C++ Object Model
QuoteRef: liptRJ12_1975 ;;Lipton, R.J., Reduction: a method of proving programs of parallel programs
QuoteRef: liptRJ2_1977 ;;Lipton, R.J., Snyder, L., On the power of applicative languages
QuoteRef: liptRJ9_1988 ;;Lipton, R.J., Sandberg, J.S., PRAM: a scalable shared memory
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: liskB9_1989 ;;Liskov, B. et al., Efficient at-most-once messages based on synchronized clocks
QuoteRef: liskB_1996 ;;Liskov, B., A history of CLU, with transcript of presentation
QuoteRef: liskBH2_1976 ;;Liskov, B.H., An introduction to CLU
QuoteRef: liskBH11_1979 ;;Liskov, B., Snyder, A., Exception handling in CLU
QuoteRef: littB11_1993 ;;Littlewood, B., Strigini, L., Validation of ultrahigh dependability for software-based systems
QuoteRef: littDC12_1987 ;;Littman, D.C. et al., Mental models and software maintenance
QuoteRef: litwW10_1980 ;;Litwin, W., Linear hashing : a new tool for file and table addressing
QuoteRef: litwWA7_1991 ;;Litwin, W.A. et al., Trie hashing with controlled load
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: liuCL1_1973 ;;Liu, C.L., Layland, J.W., Scheduling algorithms for multiprogramming in a hard-real-time environment
QuoteRef: liuF5_2016 ;;Liu, F. et al., Efficient online cycle detection technique combining with Steensgaard points-to information [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: liuY8_2005 ;;Liu, Y., Snoeyink, J., A comparison of five implementations of 3D Delaunay tessellation
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: liuZ2_1998 ;;Liu, Z. et al., An improved adaptive string searching algorithm
QuoteRef: liuZ6_2017 ;;Liu, Z., Criswell, J., Flexible and efficient memory object metadata [NewQuotes]
QuoteRef: ljunS2_1988 ;;Ljungkvist, S., Letter to the editor
QuoteRef: lloyW4_2013 ;;Lloyd, W. et al., Stronger semantics for low-latency geo-replicated storage
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: lockLL_1923 ;;Locke, L.L., The Ancient Quipu or Peruvian Knot Record [NewQuotes]
QuoteRef: loffM8_2007 ;;Loffler, M., van Kreveld, M., Largest bounding box, smallest diameter, and related problems on imprecise points [NewQuotes]
QuoteRef: logiA4_2001 ;;Loginov, A. et al., Debugging via run-time type checking
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: lomaM1_1995 ;;Lomas, M., Christianson, B., Remote booting in a hostile world. To whom am I speaking?
QuoteRef: lombP_1158 ;;Lombard, P., The Sentences [NewQuotes]
QuoteRef: lomeD6_1989 ;;Lomet, D., Salzberg, B., Access methods for multiversion data
QuoteRef: lomeD_1993 ;;Lomet, D. et al., Transaction-time databases
QuoteRef: lomeDB1_1975 ;;Lomet, D.B., Schema for invalidating references to freed storage
QuoteRef: lomeDB1_1985 ;;Lomet, D.B., Making pointers safe in system programming languages
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: lopiP3_1983 ;;Lopiccola, P., Wrege, R., Visicorp's VisiOn
QuoteRef: loreMP19_1997 ;;Lorenzo, M.-P. (d. 1986), The editors, Aristotle and Aristotelianism, Assessment and nature of Aristotelianism
QuoteRef: loseRM3_1997 ;;Losee, R.M., A discipline independent definition of information
QuoteRef: lotsJ8_2002 ;;Lotspiech, J. et al., Broadcast encryption's bright future
QuoteRef: louiRP8_1996 ;;Loui, R.P., Why GAWK for AI?
QuoteRef: louxMJ_1970 ;;Loux, M.J., The problem of universals
QuoteRef: loveAO_1936 ;;Lovejoy, A.O., The Great Chain of Being. A study of the history of an idea [NewQuotes]
QuoteRef: lowGC1_1990 ;;Low, G.C., Jeffery, D.R., Function points in the estimation and evaluation of the software process
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: loweDG8_1985 ;;Lowe, D.G., Co-operative structuring of information: the representation of reasoning and debate.
QuoteRef: loweG9_2009 ;;Lowe, G. et al., Casper: a compiler for the analysis of security protocols. User manual and tutorial
QuoteRef: lowrMC12_2002 ;;Lowry, M.C., Munro, D.S., Safe and complete distributed garbage collection with the train algorithm
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: lozaT7_1983 ;;Lozano-Perez, T., Robot programming
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: luQ_1999 ;;Lu, Q., Teng. S.H., Efficient large-scale access control for internet/intranet information systems
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: lucr_55 ;;Lucretius (Titus Lucretius Carus), De Rerum Natura
QuoteRef: luenEA5_2021 ;;Luengo, E.A., Villalba, L.J.G., Recommendations on statistical randomness test batteries for cryptographic purposes [NewQuotes]
QuoteRef: luhJY2_1983 ;;Luh, J.Y.S., An anatomy of industrial robots and their controls
QuoteRef: lumVY4_1971 ;;Lum, V.Y. et al., Key-to-address transform techniques: a fundamental performance study on large existing formatted files
QuoteRef: luoS8_2020 ;;Luo, S. et al., Scalable linear algebra on a relational database system [NewQuotes]
QuoteRef: luriAR_1972 ;;Luria, A.R., The History of a Brain Wound: The Man with a Shattered World [NewQuotes]
QuoteRef: lvinVB3_2008 ;;Lvin, V.B. et al., Archipelago: trading address space for reliability and security
QuoteRef: lyncWC12_1972 ;;Lynch, W.C., Do disk arms move?
QuoteRef: lyonJ6_1949 ;;Lyons, J. & Company, A Non-Technical Description of E.D.S.A.C. How the Cambridge Electronic Calculator works [NewQuotes]

Related up

ThesaHelp: references a-b
ThesaHelp: references c-d
ThesaHelp: references e-f
ThesaHelp: references g-h
ThesaHelp: references m-o
ThesaHelp: references p-r
ThesaHelp: references sa-sz
ThesaHelp: references t-z

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