|
Mark N. Wegman
Mark N. Wegman is an American computer scientist known for his contributions to algorithms and compiler optimization. Wegman received his B.A. from New York University and his Ph.D. from the University of California, Berkeley. He joined IBM Research in 1975, where he currently serves as head of Computer Science. He is a member of the IBM Academy of Technology and a Fellow of the Association for Computing Machinery (1996) and the Institute of Electrical and Electronics Engineers. He became an IBM Fellow in 2007. He was elected to the National Academy of Engineering in 2010. Wegman is best known for being one of the inventors of the Static single assignment form, which is used in the analysis portion of most if not all modern optimizing compilers. This work was recognized by SIGPLAN in 2006 with its Programming Languages Achievement Award. He has also made contributions to algorithms and information theory including universal hashing In mathematics and computing, universal has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Scientist
A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (although there is overlap). Although computer scientists can also focus their work and research on specific areas (such as algorithm and data structure development and design, software engineering, information theory, database theory, computational complexity theory, numerical analysis, programming language theory, computer graphics, and computer vision), their foundation is the theoretical study of computing from which these other fields derive. A primary goal of computer scientists is to develop or validate models, often mathematical, to describe the properties of computational systems (processors, programs, computers interacting with people, computers interacting with other computers, etc.) with an overall objective of discovering des ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SIGPLAN
SIGPLAN is the Association for Computing Machinery's Special Interest Group on programming languages. Conferences * Principles of Programming Languages (POPL) * Programming Language Design and Implementation (PLDI) * International Symposium on Memory Management (ISMM) * Languages, Compilers, and Tools for Embedded Systems (LCTES) * Symposium on Principles and Practice of Parallel Programming (PPoPP) * International Conference on Functional Programming (ICFP) * Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH) * Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) * History of Programming Languages (HOPL) * Dynamic Languages Symposium (DLS) Associated journals * ACM Transactions on Architecture and Code Optimization * ACM Transactions on Programming Languages and Systems Proceedings of the ACM on Programming Languages Newsletters * SIGPLAN Notices - Home pageat ACM * Fortran Forum - * Lisp Pointers (final issue 1995) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Members Of The United States National Academy Of Engineering
Member may refer to: * Military jury, referred to as "Members" in military jargon * Element (mathematics), an object that belongs to a mathematical set * In object-oriented programming, a member of a class ** Field (computer science), entries in a database ** Member variable, a variable that is associated with a specific object * Limb (anatomy), an appendage of the human or animal body ** Euphemism for penis * Structural component of a truss, connected by nodes * User (computing), a person making use of a computing service, especially on the Internet * Member (geology), a component of a geological formation * Member of parliament * The Members, a British punk rock band * Meronymy, a semantic relationship in linguistics * Church membership, belonging to a local Christian congregation, a Christian denomination and the universal Church * Member, a participant in a club or learned society A learned society (; also learned academy, scholarly society, or academic association) is an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fellow Members Of The IEEE
A fellow is a concept whose exact meaning depends on context. In learned or professional societies, it refers to a privileged member who is specially elected in recognition of their work and achievements. Within the context of higher educational institutions, a fellow can be a member of a highly ranked group of teachers at a particular college or university or a member of the governing body in some universities (such as the Fellows of Harvard College); it can also be a specially selected postgraduate student who has been appointed to a post (called a fellowship) granting a stipend, research facilities and other privileges for a fixed period (usually one year or more) in order to undertake some advanced study or research, often in return for teaching services. In the context of research and development-intensive large companies or corporations, the title "fellow" is sometimes given to a small number of senior scientists and engineers. In the context of medical education in No ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Computer Scientists
American(s) may refer to: * American, something of, from, or related to the United States of America, commonly known as the "United States" or "America" ** Americans, citizens and nationals of the United States of America ** American ancestry, people who self-identify their ancestry as "American" ** American English, the set of varieties of the English language native to the United States ** Native Americans in the United States, indigenous peoples of the United States * American, something of, from, or related to the Americas, also known as "America" ** Indigenous peoples of the Americas * American (word), for analysis and history of the meanings in various contexts Organizations * American Airlines, U.S.-based airline headquartered in Fort Worth, Texas * American Athletic Conference, an American college athletic conference * American Recordings (record label), a record label previously known as Def American * American University, in Washington, D.C. Sports teams Soccer * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lempel–Ziv–Welch
Lempel–Ziv–Welch (LZW) is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978. The algorithm is simple to implement and has the potential for very high throughput in hardware implementations. It is the algorithm of the widely used Unix file compression utility compress and is used in the GIF image format. Algorithm The scenario described by Welch's 1984 paper encodes sequences of 8-bit data as fixed-length 12-bit codes. The codes from 0 to 255 represent 1-character sequences consisting of the corresponding 8-bit character, and the codes 256 through 4095 are created in a dictionary for sequences encountered in the data as it is encoded. At each stage in compression, input bytes are gathered into a sequence until the next character would make a sequence with no code yet in the dictionary. The co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Hashing
In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer science, for example in implementations of hash tables, randomized algorithms, and cryptography. Introduction Assume we want to map keys from some universe U into m bins (labelled = \). The algorithm will have to handle some data set S \subseteq U of , S, =n keys, which is not known in advance. Usually, the goal of hashing is to obtain a low number of collisions (keys from S that land in the same bin). A deterministic hash function cannot offer any guarantee in an adversarial sett ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Static Single Assignment Form
In compiler design, static single assignment form (often abbreviated as SSA form or simply SSA) is a property of an intermediate representation (IR) that requires each variable to be assigned exactly once and defined before it is used. Existing variables in the original IR are split into ''versions'', new variables typically indicated by the original name with a subscript in textbooks, so that every definition gets its own version. In SSA form, use-def chains are explicit and each contains a single element. SSA was proposed by Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck in 1988. Ron Cytron, Jeanne Ferrante and the previous three researchers at IBM developed an algorithm that can compute the SSA form efficiently. One can expect to find SSA in a compiler for Fortran, C or C++, whereas in functional language compilers, such as those for Scheme and ML, continuation-passing style (CPS) is generally used. SSA is formally equivalent to a well-behaved subset of CPS excludi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |