Michael Rodeh

Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003

2002

The passport control problem or how to keep a dynamic service system load balanced?

[BibT_eX]

[DOI]

Hadas Shachnai

Theor. Comput. Sci., 2002

2001

Cleanness Checking of String Manipulations in C Programs via Integer Analysis.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 8th International Symposium, 2001

2000

Text Indexing and Dictionary Matching with One Error.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Checking Cleanness in Linked Lists.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 7th International Symposium, 2000

1999

Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization.

[BibT_eX]

[DOI]

Nadav Eiron

Iris Steinwarts

ACM J. Exp. Algorithmics, 1999

Finding Circular Attributes in Attribute Grammars.

[BibT_eX]

[DOI]

J. ACM, 1999

On an Algorithm of Zemlyachenko for Subtree Isomorphism.

[BibT_eX]

[DOI]

Yefim Dinitz

Inf. Process. Lett., 1999

Indexing and Dictionary Matching with One Error.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures.

[BibT_eX]

[DOI]

Shai Rubin

Proceedings of the Compiler Construction, 8th International Conference, 1999

1998

A Logic-Based Approach to Program Flow Analysis.

[BibT_eX]

[DOI]

Acta Informatica, 1998

Matrix Multiplication: A Case Study of Algorithm Engineering.

[BibT_eX]

Nadav Eiron

Iris Steinwarts

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience).

[BibT_eX]

[DOI]

Proceedings of the SIGPLAN/SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, 1998

1992

Proving Safety of Speculative Load Instructions at Compile Time.

[BibT_eX]

[DOI]

Proceedings of the ESOP '92, 1992

1991

Global Instruction Scheduling for Superscalar Machines.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991

1990

Symmetry breaking in distributed networks

[BibT_eX]

[DOI]

Inf. Comput., September, 1990

A Logic-Based Approach to Data Flow Analysis Problem.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1990

1989

On the Complexity of Scheduling Problems for Parallel/Pipelined Machines.

[BibT_eX]

[DOI]

Izidor Gertner

IEEE Trans. Computers, 1989

Scheduling Arithmetic and Load Operations in Parallel with No Spilling.

[BibT_eX]

[DOI]

Jeffrey M. Jaffe

SIAM J. Comput., 1989

Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines.

[BibT_eX]

[DOI]

Izidor Gertner

J. Algorithms, 1989

Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

A dialogue manager for efficient adaptive man-machine dialogues.

[BibT_eX]

[DOI]

Jacob P. Ukelson

Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

1988

The Multi-Tree Approach to Reliability in Distributed Networks

[BibT_eX]

[DOI]

Inf. Comput., October, 1988

FLAME - An Efficient Access Method for Optical Disks.

[BibT_eX]

[DOI]

Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1988

1985

Scheduling Transmissions in a Network.

[BibT_eX]

[DOI]

J. Algorithms, 1985

Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses.

[BibT_eX]

[DOI]

Ron Y. Pinter

Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

1983

Distributed k-Selection: From a Sequential to a Distributed Algorithm.

[BibT_eX]

[DOI]

Liuba Shrira

Nissim Francez

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

1982

Achieving Distributed Termination without Freezing.

[BibT_eX]

[DOI]

Nissim Francez

IEEE Trans. Software Eng., 1982

A fast test for unique decipherability based on suffix trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

Finding the Median Distributively.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle.

[BibT_eX]

[DOI]

Danny Dolev

Maria M. Klawe

J. Algorithms, 1982

Representation of Graphs.

[BibT_eX]

[DOI]

Acta Informatica, 1982

1981

A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area.

[BibT_eX]

[DOI]

David Steinberg

IEEE Trans. Computers, 1981

Covering Graphs by Simple Circuits.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Richard J. Lipton

SIAM J. Comput., 1981

Linear Algorithm for Data Compression via String Matching.

[BibT_eX]

[DOI]

Vaughan R. Pratt

Shimon Even

J. ACM, 1981

A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area.

[BibT_eX]

[DOI]

David Steinberg

Inf. Process. Lett., 1981

Distributed Termination with Interval Assertions.

[BibT_eX]

[DOI]

N. Frances

Michel Sintzoff

Proceedings of the Formalization of Programming Concepts, 1981

A Sparse Table Implementation of Priority Queues.

[BibT_eX]

[DOI]

Alan G. Konheim

Proceedings of the Automata, 1981

Symmetry Breaking in Distributive Networks

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

A System for Constructing Linear Programming Models.

[BibT_eX]

[DOI]

Shmuel Katz

Lawrence J. Risman

IBM Syst. J., 1980

A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme

[BibT_eX]

[DOI]

Nissim Francez

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Designing efficient algorithms for APL: A case study of a hydraulic-network solver.

[BibT_eX]

[DOI]

Emanuel Gofman

Proceedings of the international conference on APL, 1979

1978

Finding a Minimum Circuit in a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

Some Matching Problems for Bipartite Graphs.

[BibT_eX]

[DOI]

Steven L. Tanimoto

J. ACM, 1978

Economical Encoding of Commas Between Strings.

[BibT_eX]

[DOI]

Shimon Even

Commun. ACM, 1978

Covering a Graph by Circuits.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1978

1977

Some Matching Problems.

[BibT_eX]

[DOI]