Seznam publikacij s področja računalništva

Iz Wikipedije, proste enciklopedije
Skoči na: navigacija, iskanje

To je seznam publikacij s področja računalništva. Predloga:TOClimit


Teoretično računalništvo[uredi | uredi kodo]

Paralelno računanje in porazdeljeno računanje[uredi | uredi kodo]

Računalniški jeziki[uredi | uredi kodo]

Realization of Natural-Language Interfaces Using Lazy Functional Programming[uredi | uredi kodo]

Description: This survey documents relatively less researched importance of lazy functional programming languages (i.e. Haskell) to construct Natural Language Processors and to accommodated many linguistic theories.

Operacijski sistemi[uredi | uredi kodo]

An experimental timesharing system.[uredi | uredi kodo]

Description: This paper discuss time-sharing as a method of sharing computer resource. This idea changed the interaction with computer systems.

The Working Set Model for Program Behavior[uredi | uredi kodo]

Description: The beginning of cache. For more information see SIGOPS Hall of Fame.

Virtual Memory, Processes, and Sharing in MULTICS[uredi | uredi kodo]

Description: The classic paper on the most ambitious operating system in the early history of computing. Difficult reading, but it describes the implications of trying to build a system that takes information sharing to its logical extreme. Most operating systems since Multics have incorporated a subset of its facilities.

A note on the confinement problem[uredi | uredi kodo]

Description: This paper addresses issues in constraining the flow of information from untrusted programs. It discusses covert channels, but more importantly it addresses the difficulty in obtaining full confinement without making the program itself effectively unusable. The ideas are important when trying to understand containment of malicious code, as well as aspects of trusted computing.

The UNIX Time-Sharing System[uredi | uredi kodo]

Description: The Unix operating system and its principles were described in this paper. The main importance is not of the paper but of the operating system, which had tremendous effect on operating system and computer technology.

Weighted voting for replicated data[uredi | uredi kodo]

Description: This paper describes the consistency mechanism known as quorum consensus. It is a good example of algorithms that provide a continuous set of options between two alternatives (in this case, between the read-one write-all, and the write-one read-all consistency methods). There have been many variations and improvements by researchers in the years that followed, and it is one of the consistency algorithms that should be understood by all. The options available by choosing different size quorums provide a useful structure for discussing of the core requirements for consistency in distributed systems.

Experiences with Processes and Monitors in Mesa[uredi | uredi kodo]

Description: This is the classic paper on synchronization techniques, including both alternate approaches and pitfalls.

Scheduling Techniques for Concurrent Systems[uredi | uredi kodo]

  • J. K. Ousterhout
  • Proceedings of Third International Conference on Distributed Computing Systems, 1982, 22—30.

Description: Algorithms for coscheduling of related processes were given

A Fast File System for UNIX[uredi | uredi kodo]

Description: The file system of UNIX. One of the first papers discussing how to manage disk storage for high-performance file systems. Most file-system research since this paper has been influenced by it, and most high-performance file systems of the last 20 years incorporate techniques from this paper.

The Design and Implementation of a Log-Structured File System[uredi | uredi kodo]

Description: Log-structured file system.

Microkernel operating system architecture and Mach[uredi | uredi kodo]

Description: This is a good paper discussing one particular microkernel architecture and contrasting it with monolithic kernel design. Mach underlies Mac OS X, and its layered architecture had a significant impact on the design of the Windows NT kernel and modern microkernels like L4. In addition, its memory-mapped files feature was added to many monolithic kernels.

An Implementation of a Log-Structured File System for UNIX[uredi | uredi kodo]

Description: The paper was the first production-quality implementation of that idea which spawned much additional discussion of the viability and short-comings of log-structured filesystems. While »The Design and Implementation of a Log-Structured File System« was certainly the first, this one was important in bringing the research idea to a usable system.

Soft Updates: A Solution to the Metadata Update problem in File Systems[uredi | uredi kodo]

Description: A new way of maintaining filesystem consistency.

Podatkovne zbirke[uredi | uredi kodo]

A relational model for large shared data banks[uredi | uredi kodo]

Description: This paper introduced the relational model for databases. This model became the number one model.

Binary B-Trees for Virtual Memory[uredi | uredi kodo]

  • Rudolf Bayer
  • ACM-SIGFIDET Workshop 1971, San Diego, California, Session 5B, p. 219-235.

Description: This paper introduced the B-Trees data structure. This model became the number one model.

Relational Completeness of Data Base Sublanguages[uredi | uredi kodo]

  • E. F. Codd
  • In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972)
  • Online version (PDF)

Description: Completeness of Data Base Sublanguages

The Entity Relationship Model – Towards a Unified View of Data[uredi | uredi kodo]

Description: This paper introduced the Entity-relationship diagram(ERD) method of database design.

SEQUEL: A structured English query language[uredi | uredi kodo]

  • Donald D. Chamberlin, Raymond F. Boyce
  • International Conference on Management of Data, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, Ann Arbor, Michigan, pp. 249–264

Description: This paper introduced the SQL language.

The notions of consistency and predicate locks in a database system[uredi | uredi kodo]

Description: This paper defined the concepts of transaction, consistency and schedule.It also argued that a transaction needs to lock a logical rather than a physical subset of the database.

Mining association rules between sets of items in large databases[uredi | uredi kodo]

Description: Association rules, a very common method for data mining.

Principles of Transaction-Oriented Database Recovery[uredi | uredi kodo]

Description: Introduced the ACID paradigm for transactions.

Information Retrieval[uredi | uredi kodo]

A Vector Space Model for Automatic Indexing[uredi | uredi kodo]

Description: Presented the vector space model.

Extended Boolean Information Retrieval[uredi | uredi kodo]

Description: Presented the inverted index

Kriptografija[uredi | uredi kodo]

The index of coincidence and its applications in cryptology[uredi | uredi kodo]

  • William F. Friedman
  • The index of coincidence and its applications in cryptology, Department of Ciphers. Publ 22. Geneva, Illinois, USA: Riverbank Laboratories, 1922.

Description: Presented the index of coincidence method for codebreaking.

Treatise on the Enigma[uredi | uredi kodo]

Description: The breaking of the Enigma.

Communication Theory of Secrecy Systems[uredi | uredi kodo]

Description: Information theory based analysis of cryptography. The original form of this paper was a confidential Bell Labs report from 1945, not the one published.

The Codebreakers, The Story of Secret Writing[uredi | uredi kodo]

Description: Almost nothing had been published in cryptography in several decades and very few non-government researchers were thinking about it. The Codebreakers, a popular and not academic book, made many more people aware and contains a lot of technical information, although it requires careful reading to extract it. Its 1967 appearance was followed by the appearance of many papers over the next few years.

Cryptographic Coding for Data-Bank Privacy[uredi | uredi kodo]

Description: Feistel ciphers are a form of cipher of which DES is the most important. It would be hard to overestimate the importance of either Feistel or DES. Feistel pushed a transition from stream ciphers to block ciphers. Although most ciphers operate on streams, most of the important ciphers today are block ciphers at their core.

Data Encryption Standard[uredi | uredi kodo]

  • NBS Federal Standard FIPS PUB 46, 15 Jan 1977.

Description: DES is not only one of the most widely deployed ciphers in the world but has had a profound impact on the development of cryptography. Roughly a generation of cryptographers devoted much of their time to attacking and improving DES.

New directions in cryptography[uredi | uredi kodo]

Description: This paper suggested public key cryptography and presented Diffie-Hellman key exchange. For more information about this work see: W.Diffie, M.E.Hellman, »Privacy and Authentication: An Introduction to Cryptography«, in Proc. IEEE, Vol 67(3) Mar 1979, pp 397–427.

On the Signature Reblocking Problem in Public Key[uredi | uredi kodo]

Description: In this paper (along with Loren M. Kohnfelder,"Using Certificates for Key Distribution in a Public-Key Cryptosystem«, MIT Technical report 19 May 1978), Kohnfelder introduced certificates (signed messages containing public keys) which are the heart of all modern key management systems.

Secure Communications Over Insecure Channels[uredi | uredi kodo]

Description: This paper introduced a branch public key cryptography, known as public key distribution systems. Merkle work predated »New directions in cryptography« though it was published after it. The Diffie-Hellman key exchange is an implementation of such a Merkle system. Hellman himself has argued that the more correct name would be Diffie-Hellman-Merkle key exchange.

A Method for Obtaining Digital Signatures and Public Key Cryptosystems[uredi | uredi kodo]

Description: The RSA encryption method. The first public key encryption method.

Using encryption for authentication in large networks of computers[uredi | uredi kodo]

Description: This paper introduced the basic ideas of cryptographic protocols and showed how both secret-key and public-key encryption could be used to achieve authentication.

How to Share a Secret[uredi | uredi kodo]

Description: A safe method for sharing a secret.

Data Security[uredi | uredi kodo]

Description: A paper that surveys the problems in creating secure systems. The description of database inference is particularly chilling; after reading this you'll understand why it is very difficult to publish aggregated information such as census data without accidentally exposing the private information of individuals.

Security policies and security models[uredi | uredi kodo]

Description: Noninterference is the study of when interaction by one user with a system can affect what a second user sees. It can be applied to trying to stop an attacker disrupting the second user's view of the system, or to analysing whether a high-security first user can pass information to a low-level second user via a covert channel. This paper was the first to give a useful characterisation of this property.

On the security of public key protocols[uredi | uredi kodo]

  • D Dolev, A Yao
  • IEEE transactions on Information Theory Vol 2 number 3, 1983

Description: Introduced the model of the adversary against which almost all cryptographic protocols are judged.

Probabilistic Encryption[uredi | uredi kodo]

Description: The paper provides a rigorous basis to encryption (e.g., partial information) and shows that it possible to equate the slightest cryptanalysis to solve a pure math problem. Second, it introduces the notion of computational indistinguishability that has and will underpin our understanding of the world, since ultimately we all are bounded computational entities.

Fast, rigorous factorization and discrete logarithm algorithms[uredi | uredi kodo]

  • Carl Pomerance
  • D. S. Johnson, T. Nishizeki, A. Nozaki, H. S. Wilf, eds., Academic Press, Orlando, Florida, 1987, pp. 119–143.

Description: First published sub exponential algorithm to the Discrete logarithm problem. The Discrete logarithm problem is the base of many cryptographic systems. Pomerance algorithm is second chronologically to the work of Rich Schroeppel's work. Schroeppel rarely published and preferred to circulate his work to interested researchers. Schroeppel's work is referenced at Knuth, vol. 2, 2nd edition, pages 383-384.

How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design[uredi | uredi kodo]

Description: This paper explains how to construct a zero-knowledge proof system for any language in NP.

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority[uredi | uredi kodo]

Description: Seminal paper in secure function evaluation

The Digital distributed system security architecture[uredi | uredi kodo]

Description: This paper discusses issues related to privileges and authentication of software and hardware components in distributed systems. It is interesting in that it formalizes the understanding of the rights used by programs and software running on bahalf of users and other entities. The concepts from this paper provide an early glimpse at the issues of atestation addressed much later by trusted computing architectures.

Kerberos: An Authentication Service for Open Network Systems[uredi | uredi kodo]

Description: The Kerberos authentication protocol, which allows individuals communicating over an insecure network to prove their identity to one another in a secure and practical manner.

Differential Cryptanalysis of DES-like Cryptosystems[uredi | uredi kodo]

Description: The method of Differential cryptanalysis.

A new method for known plaintext attack of FEAL cipher[uredi | uredi kodo]

Description: The method of Linear cryptanalysis.

Breaking and Fixing the Needham-Schroeder Public-Key protocol using FDR[uredi | uredi kodo]

Description: Used a standard model checker to analyse one of the original cryptographic protocols that had long been believed correct. By exposing what is now the most famous protocol attack using this method, this paper inspired an explosion of interest in the verification and analysis of such protocols that continues to this day.

Differential Collisions in SHA-0[uredi | uredi kodo]

Description: A method for finding collisions in SHA-0 hash function.

EFF DES cracker[uredi | uredi kodo]

Description: »the EFF DES cracker« (nicknamed »Deep Crack«) is a machine built by the Electronic Frontier Foundation (EFF) to perform a brute force search of DES's keyspace—that is, to decrypt an encrypted message by trying every possible key. The aim in doing this was to prove that DES's key is not long enough to be secure.

Umetna inteligenca[uredi | uredi kodo]

Computing machinery and intelligence[uredi | uredi kodo]

Description: This paper discusses whether machine can think and suggested the Turing test as a method for checking it.

A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence[uredi | uredi kodo]

Description: This summer research proposal inaugurated and defined the field. It contains the first use of the term artificial intelligence and this succinct description of the philosophical foundation of the field: »every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it.« (See philosophy of AI) The proposal invited researchers to the Dartmouth conference, which is widely considered the »birth of AI«. (See history of AI.)

Fuzzy sets[uredi | uredi kodo]

Description: The seminal paper published in 1965 provides details on the mathematics of fuzzy set theory.

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference[uredi | uredi kodo]

Description: This book introduced Bayesian methods to AI.

Artificial Intelligence: A Modern Approach[uredi | uredi kodo]

Description: The standard textbook in Artificial Intelligence. The book web site lists over 1100 colleges and universities in 102 countries using it.

Strojno učenje[uredi | uredi kodo]

An Inductive Inference Machine[uredi | uredi kodo]

  • Ray Solomonoff
  • IRE Convention Record, Section on Information Theory, Part 2, pp. 56–62, 1957
  • (A longer version of this, a privately circulated report, 1956, is online).

Description: The first paper written on machine learning. Emphasized the importance of training sequences, and the use of parts of previous solutions to problems in constructing trial solutions to new problems.

Language identification in the limit[uredi | uredi kodo]

Description: This paper created Algorithmic learning theory.

On the uniform convergence of relative frequencies of events to their probabilities[uredi | uredi kodo]

Description: Computational learning theory, VC theory, statistical uniform convergence and the VC dimension.

A theory of the learnable[uredi | uredi kodo]

Description: The Probably approximately correct learning (PAC learning) framework.

Learning representations by back-propagating errors[uredi | uredi kodo]

Description: Development of Backpropagation algorithm for artificial neural networks. Note that the algorithm was first described by Paul Werbos in 1974.

Induction of Decision Trees[uredi | uredi kodo]

Description: Decision Trees are a common learning algorithm and a decision representation tool. Development of decision trees was done by many researchers in many areas, even before this paper. Though this paper is one of the most influential in the field.

Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm[uredi | uredi kodo]

Description: One of the papers that started the field of on-line learning. In this learning setting, a learner receives a sequence of examples, making predictions after each one, and receiving feedback after each prediction. Research in this area is remarkable because (1) the algorithms and proofs tend to be very simple and beautiful, and (2) the model makes no statistical assumptions about the data. In other words, the data need not be random (as in nearly all other learning models), but can be chosen arbitrarily by »nature« or even an adversary. Specifically, this paper introduced the winnow algorithm.

Learning to predict by the method of temporal differences[uredi | uredi kodo]

Description: The temporal differences method for reinforcement learning.

Learnability and the Vapnik-Chervonenkis dimension[uredi | uredi kodo]

Description: The complete characterization of PAC learnability using the VC dimension.

Cryptographic limitations on learning boolean formulae and finite automata [uredi | uredi kodo]

Description: Proving negative results for PAC learning.

The strength of weak learnability[uredi | uredi kodo]

Description: Proving that weak and strong learnability are equivalent in the noise free PAC framework. The proof was done by introducing the boosting method.

Learning in the presence of malicious errors[uredi | uredi kodo]

Description: Proving possibility and impossibility result in the malicious errors framework.

A training algorithm for optimum margin classifiers[uredi | uredi kodo]

Description: This paper presented support vector machines, a practical and popular machine learning algorithm. Support vector machines utilize the kernel trick, a generally used method.

Knowledge-based analysis of microarray gene expression data by using support vector machines[uredi | uredi kodo]

Description: The first application of supervised learning to gene expression data, in particular Support Vector Machines. The method is now standard, and the paper one of the most cited in the area.

Računalniški vid[uredi | uredi kodo]

The Phase Correlation Image Alignment Method [uredi | uredi kodo]

  • C.D. Kuglin and D.C. Hines
  • IEEE 1975 Conference on Cybernetics and Society, 1975, New York, pp. 163–165, September

Description: A correlation method based upon the inverse Fourier transform

Determining Optical Flow[uredi | uredi kodo]

Description: A method for estimating the image motion of world points between 2 frames of a video sequence.

An Iterative Image Registration Technique with an Application to Stereo Vision[uredi | uredi kodo]

Description: This paper provides efficient technique for image registration

The Laplacian Pyramid as a compact image code[uredi | uredi kodo]

Description: A technique for image encoding using local operators of many scales.

Snakes: Active contour models[uredi | uredi kodo]

Description: An interactive variational technique for image segmentation and visual tracking.

Condensation – conditional density propagation for visual tracking[uredi | uredi kodo]

Description: A technique for visual tracking

Object recognition from local scale-invariant features [uredi | uredi kodo]

Description: A technique (Scale-invariant feature transform) for robust feature description

Compilers[uredi | uredi kodo]

On the translation of languages from left to right[uredi | uredi kodo]

Description: Bottom up parsing for deterministic context-free languages from which later the LALR approach of Yacc developed.

Semantics of Context-Free Languages.[uredi | uredi kodo]

Description: About grammar attribution, the base for yacc's s-attributed and zyacc's LR-attributed approach.

A program data flow analysis procedure[uredi | uredi kodo]

Description: From the abstract: »The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly reach each node of the control flow graph of the program and all the definitions that are live on each edge of the graph."

A Unified Approach to Global Program Optimization[uredi | uredi kodo]

Description: Formalized the concept of data-flow analysis as fixpoint computation over lattices, and showed that most static analyses used for program optimization can be uniformly expressed within this framework.

YACC: Yet another compiler-compiler[uredi | uredi kodo]

Description: Yacc is a tool that made compiler writing much easier.

gprof: A Call Graph Execution Profiler[uredi | uredi kodo]

Description: The gprof profiler

Compilers: Principles, Techniques and Tools [uredi | uredi kodo]

Description: This book became a classic in compiler writing. It is also known as the Dragon book, after the (red) dragon that appears on its cover.

Programski inžinering[uredi | uredi kodo]

Software engineering: Report of a conference sponsored by the NATO Science Committee[uredi | uredi kodo]

Description: Conference of leading figures in software field circa 1968
The paper defined the field of Software engineering

Go To Statement Considered Harmful[uredi | uredi kodo]

Description: Don't use goto – the beginning of structured programming.

On the criteria to be used in decomposing systems into modules[uredi | uredi kodo]

Description: The importance of modularization and information hiding. Note that information hiding was first presented in a different paper of the same author - »Information Distributions Aspects of Design Methodology«, Proceedings of IFIP Congress '71, 1971, Booklet TA-3, pp. 26–30

Hierarchical Program Structures[uredi | uredi kodo]

  • Ole-Johan Dahl, C. A. R. Hoare
  • in Dahl, Dijkstra and Hoare, Structured Programming, Academic Press, London and New York, pp. 175–220, 1972.

Description: The beginning of Object-oriented programming. This paper argued that programs should be decomposed to independent components with small and simple interfaces. They also argued that objects should have both data and related methods.

A technique for software module specification with examples[uredi | uredi kodo]

Description: software specification.

Structured Design[uredi | uredi kodo]

Description: Seminal paper on Structured Design, data flow diagram, coupling, and cohesion.

The Emperor's Old Clothes[uredi | uredi kodo]

Description: A lovely story of how large software projects can go right, and then wrong, and then right again, told with humility and humor. Illustrates the »second-system effect« and the importance of simplicity.

The Mythical Man-Month: Essays on Software Engineering[uredi | uredi kodo]

Description: Throwing more people at the task will not speed its completion...

No Silver Bullet: Essence and Accidents of Software Engineering[uredi | uredi kodo]

Description: We will keep having problems with software...

The Cathedral and the Bazaar[uredi | uredi kodo]

Description: Open source methodology.

Design Patterns: Elements of Reusable Object Oriented Software[uredi | uredi kodo]

Description: This book was the first to define and list design patterns in computer science.

Statecharts: A Visual Formalism For Complex Systems[uredi | uredi kodo]

  • David Harel
  • D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231—274, 1987
  • Online version

Description: Statecharts are a visual modeling method. They are an extension of state machine that might be exponentially more efficient. Therefore, statcharts enable formal modeling of applications that were too complex before. Statecharts are part of the UML diagrams.

Technology of Automata-based programming[uredi | uredi kodo]

Description: Technology of Automata-based programming is a programming techology based on a principle of using finite state machine as a description of behavior and isomorphical transformation from state machine to code.

Računalniško omrežja[uredi | uredi kodo]

A Protocol for Packet Network Interconnection[uredi | uredi kodo]

Description: Packet Network Interconnection.

Ethernet: Distributed packet switching for local computer networks[uredi | uredi kodo]

Description: The Ethernet protocol.

End-To-End Arguments in System Design[uredi | uredi kodo]

Description: Many of critical design problems in networking and systems focus on the right »layer« in which to provide particular functionality. The basic debate is whether the core system or network should provide the functionality, or whether it should be left to the end-system or application to implement using more basic primitives provided in the core network or base system. This paper highlights these issues and argues for one side. The argument has occurred over and over again in various aspects of system design and it is important to understand the basic philosophy of both sides of the debate.

Internet Protocol[uredi | uredi kodo]

Description: The Internet Protocol (IP).This paper describes the he Internet Protocol (IP), a fundamental protocol that drive the Internet. Required (but quite technical) reading for anyone who wants to understand networking.

Transmission Control Protocol[uredi | uredi kodo]

Description: The Transmission Control Protocol (TCP).

Implementing Remote Procedure Calls[uredi | uredi kodo]

Description: This is the seminal paper on Remote Procedure Call, which provides a higher-level mechanism for communicating between the components of a distributed system.

A Dynamic Network Architecture[uredi | uredi kodo]

Description: Network software in distributed systems.

Internet[uredi | uredi kodo]

As We May Think[uredi | uredi kodo]

Description: The paper argued that as humans turned from war, scientific efforts should shift from increasing physical abilities to making all previous collected human knowledge more accessible. As We May Think predicted many kinds of technology invented after its publication, including hypertext, personal computers, the Internet, the World Wide Web, speech recognition, and online encyclopedias such as Wikipedia.

Grapevine: An Exercise in Distributed Computing[uredi | uredi kodo]

Description: The Grapevine system. The paper describes one of the first attempts to build a large-scale distributed system (the Xerox mail system). Exposes many interesting problems related to distributed systems and describes how they were solved in this particular system.

The Design Philosophy of the DARPA Internet Protocols[uredi | uredi kodo]

Description: The DARPA Internet Protocols (TCP/IP).

The Anatomy of a Large-Scale Hypertextual Web Search Engine[uredi | uredi kodo]

Description: The Anatomy of a Search Engine, known today as Google.

Programski jeziki[uredi | uredi kodo]

The FORTRAN Automatic Coding System[uredi | uredi kodo]

Description: This paper describes the design and implementation of the first FORTRAN compiler by the IBM team. Fortran is a general-purpose, procedural, imperative programming language that is especially suited to numeric computation and scientific computing.

Recursive functions of symbolic expressions and their computation by machine, part I[uredi | uredi kodo]

Description: This paper introduced LISP, the first functional programming language, which was used heavily in many areas of computer science, especially in AI. LISP also has powerful features for manipulating LISP programs within the language.

ALGOL 60[uredi | uredi kodo]

Description: Algol 60 introduced block structure.

The next 700 programming languages[uredi | uredi kodo]

Description: This seminal paper proposed an ideal language ISWIM, which without being ever implemented influenced the whole later development.

Lambda Papers[uredi | uredi kodo]

Description: This series of papers and reports first defined the influential Scheme programming language and questioned the prevailing practices in programming language design, employing lambda calculus extensively to model programming language concepts and guide efficient implementation without sacrificing expressive power.

Structure and Interpretation of Computer Programs[uredi | uredi kodo]

Description: This textbook explains core computer programming concepts, and is widely considered a classic text in computer science.

Zgradba računalnika[uredi | uredi kodo]

Colossus computer[uredi | uredi kodo]

Description: The Colossus machines were early computing devices used by British codebreakers to read encrypted German messages during World War II. Colossus was an early binary electronic digital computer. The design of Colossus was later described in the referenced paper.

First Draft of a Report on the EDVAC[uredi | uredi kodo]

Description: It contains the first published description of the logical design of a computer using the stored-program concept, which has come to be known as the von Neumann architecture.

Architecture of the IBM System/360[uredi | uredi kodo]

Description: The IBM System/360 (S/360) is a mainframe computer system family announced by IBM on April 7, 1964. It was the first family of computers making a clear distinction between architecture and implementation.

The case for the reduced instruction set computer[uredi | uredi kodo]

Description: The reduced instruction set computer( RISC) CPU design philosophy. The RISC is a CPU design philosophy that favors a reduced instruction set as well as a simpler set of instructions.

Comments on »the Case for the Reduced Instruction Set Computer"[uredi | uredi kodo]


The CRAY-1 Computer System[uredi | uredi kodo]

Description: The Cray-1 was a supercomputer designed by a team including Seymour Cray for Cray Research. The first Cray-1 system was installed at Los Alamos National Laboratory in 1976, and it went on to become one of the best known and most successful supercomputers in history.

Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities[uredi | uredi kodo]

Description: The Amdahl's Law.

A Case for Redundant Arrays of Inexpensive Disks (RAID)[uredi | uredi kodo]

Description: This paper discusses the concept of RAID disks, outlines the different levels of RAID, and the benefits of each level. It is a good paper for discussing issues of reliability and fault tolerance of computer systems, and the cost of providing such fault-tolerance.

Računalniški vid[uredi | uredi kodo]

The Rendering Equation[uredi | uredi kodo]

  • J. Kajiya
  • SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques pages 143—150 [5]

Elastically deformable models[uredi | uredi kodo]

Description: The Academy of Motion Picture Arts and Sciences cited this paper as a »milestone in computer graphics«.

Zgodovina računalništva[uredi | uredi kodo]

The Computer from Pascal to von Neumann[uredi | uredi kodo]

Description: Perhaps the first book on the history of computation.

A History of Computing in the Twentieth Century[uredi | uredi kodo]

edited by:

Description: Several chapters by pioneers of computing.

Računalništvo humor[uredi | uredi kodo]

The Complexity of Songs[uredi | uredi kodo]

Description: The article capitalizes on the tendency of popular songs to evolve from long and content-rich ballads to highly repetitive »content-free« texts.

On Folk Theorems[uredi | uredi kodo]

Description: A paper that is both serious and funny about »the things we all know«.

How to prove it[uredi | uredi kodo]

Description: Angluin presents some common proof techniques that should become less common.

Glej tudi[uredi | uredi kodo]

Awards for publications (and not for general contribution):

FDodatno gradivo[uredi | uredi kodo]

  • Laplante, Phillip (ed). (1996) Great Papers in Computer Science. New York: IEEE Press. ISBN 0-314-06365-X.
  • Randell, Brian (ed). (1982). The Origins of Digital Computers: Selected Papers. 3rd ed. Berlin: Springer-Verlag. ISBN 0-387-11319-3.
  • Turning Points in Computing: 1962-1999, Special Issue, IBM Systems Journal, 38 (2/3),1999.
  • Yourdon, Edward (ed.) (1979) Classics in Software Engineering. New York: Yourdon Press. ISBN 0-917072-14-6

Zunanje povezave[uredi | uredi kodo]

Academic Search Engines