-
Chapter and Conference Paper
Deep Packet Inspection Using Message Passing Networks
We propose a solution based on message passing bipartite networks, for deep packet inspection, which addresses both speed and memory issues, which are limiting factors in current solutions. We report on a prel...
-
Chapter and Conference Paper
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA
Context sensitive pointer analyses based on Whaley and Lam’s bddbddb system have been shown to scale to large Java programs. We provide a technique to incorporate flow sensitivity for Java fields into one such an...
-
Article
John Backus — Inventor of FORTRAN
-
Article
The evolution of compilers
The term compiler was coined in the late forties, by Grace Murray Hopper, a pioneer who rose to the challenges of programming the first computers. The problem of translation from a source language into a target l...
-
Article
Decoding Reed-Solomon codes using Euclid’s algorithm
Reed-Solomon codes are indeed an elegant illustration of a very practical application of abstract algebra. An interesting discovery was the fact that Euclid’s algorithm for finding greatest common divisors of ...
-
Chapter and Conference Paper
Algebraic Structure Theory of Tail-Biting Trellises
It is well known that there is an intimate connection between algebraic descriptions of linear block codes in the form of generator or parity-check matrices, and combinatorial descriptions in the form of trell...
-
Article
David Huffman
-
Chapter and Conference Paper
Compressing XML Documents Using Recursive Finite State Automata
We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive algorithm where the model used for compres...
-
Article
Editorial
-
Article
Editorial
-
Article
Editorial
-
Article
Editorial
-
Article
Robert W Floyd (1936–2001)
-
Article
Florence Jessie Mac Williams (1917-1990)
-
Article
Expander codes
Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applicatio...
-
Chapter and Conference Paper
Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework
This paper presents a new unified algorithm for cluster assignment and region scheduling, and its integration into an experimental retargetable code generation framework. The components of the framework are an...
-
Article
Madhu Sudan receives Nevanlinna Prize
-
Article
Claude Elwood Shannon
-
Chapter and Conference Paper
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representat...
-
Chapter and Conference Paper
A Package for the Implementation of Block Codes as Finite Automata
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformatio...