According to our database1, Michael Rodeh authored at least 46 papers between 1977 and 2003.
Legend:Book In proceedings Article PhD thesis Other
CSSV: towards a realistic tool for statically detecting all buffer overflows in C.
Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003
The passport control problem or how to keep a dynamic service system load balanced?
Theor. Comput. Sci., 2002
Cleanness Checking of String Manipulations in C Programs via Integer Analysis.
Proceedings of the Static Analysis, 8th International Symposium, 2001
Text Indexing and Dictionary Matching with One Error.
J. Algorithms, 2000
Checking Cleanness in Linked Lists.
Proceedings of the Static Analysis, 7th International Symposium, 2000
Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization.
ACM Journal of Experimental Algorithmics, 1999
Finding Circular Attributes in Attribute Grammars.
J. ACM, 1999
On an Algorithm of Zemlyachenko for Subtree Isomorphism.
Inf. Process. Lett., 1999
Indexing and Dictionary Matching with One Error.
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.
Proceedings of the Compiler Construction, 8th International Conference, 1999
A Logic-Based Approach to Program Flow Analysis.
Acta Inf., 1998
Matrix Multiplication: A Case Study of Algorithm Engineering.
Proceedings of the Algorithm Engineering, 1998
Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience).
Proceedings of the SIGPLAN/SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, 1998
Proving Safety of Speculative Load Instructions at Compile Time.
Proceedings of the ESOP '92, 1992
Global Instruction Scheduling for Superscalar Machines.
Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991
Symmetry breaking in distributed networks
Inf. Comput., September, 1990
A Logic-Based Approach to Data Flow Analysis Problem.
Proceedings of the Programming Language Implementation and Logic Programming, 1990
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines.
IEEE Trans. Computers, 1989
Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines.
J. Algorithms, 1989
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.
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.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989
FLAME - An Efficient Access Method for Optical Disks.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1988
Scheduling Arithmetic and Load Operations in Parallel with No Spilling.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987
Scheduling Transmissions in a Network.
J. Algorithms, 1985
Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985
The Multi-Tree Approach to Reliability in Distributed Networks
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Distributed k-Selection: From a Sequential to a Distributed Algorithm.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983
Achieving Distributed Termination without Freezing.
IEEE Trans. Software Eng., 1982
A fast test for unique decipherability based on suffix trees.
IEEE Trans. Information Theory, 1982
Finding the Median Distributively.
J. Comput. Syst. Sci., 1982
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle.
J. Algorithms, 1982
Representation of Graphs.
Acta Inf., 1982
A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area.
IEEE Trans. Computers, 1981
Covering Graphs by Simple Circuits.
SIAM J. Comput., 1981
Linear Algorithm for Data Compression via String Matching.
J. ACM, 1981
A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area.
Inf. Process. Lett., 1981
Distributed Termination with Interval Assertions.
Proceedings of the Formalization of Programming Concepts, 1981
A Sparse Table Implementation of Priority Queues.
Proceedings of the Automata, 1981
Symmetry Breaking in Distributive Networks
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
A System for Constructing Linear Programming Models.
IBM Systems Journal, 1980
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980
Finding a Minimum Circuit in a Graph.
SIAM J. Comput., 1978
Some Matching Problems for Bipartite Graphs.
J. ACM, 1978
Economical Encoding of Commas Between Strings.
Commun. ACM, 1978
Covering a Graph by Circuits.
Proceedings of the Automata, 1978
Some Matching Problems.
Proceedings of the Automata, 1977