default search action
Michael Rodeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [c24]Nurit Dor, Michael Rodeh, Shmuel Sagiv:
CSSV: towards a realistic tool for statically detecting all buffer overflows in C. PLDI 2003: 155-167 - 2002
- [j25]Alon Itai, Michael Rodeh, Hadas Shachnai:
The passport control problem or how to keep a dynamic service system load balanced? Theor. Comput. Sci. 282(2): 303-318 (2002) - 2001
- [c23]Nurit Dor, Michael Rodeh, Shmuel Sagiv:
Cleanness Checking of String Manipulations in C Programs via Integer Analysis. SAS 2001: 194-212 - 2000
- [j24]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000) - [c22]Nurit Dor, Michael Rodeh, Shmuel Sagiv:
Checking Cleanness in Linked Lists. SAS 2000: 115-134
1990 – 1999
- 1999
- [j23]Yefim Dinitz, Alon Itai, Michael Rodeh:
On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. 70(3): 141-146 (1999) - [j22]Michael Rodeh, Shmuel Sagiv:
Finding Circular Attributes in Attribute Grammars. J. ACM 46(4): 556 (1999) - [j21]Nadav Eiron, Michael Rodeh, Iris Steinwarts:
Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization. ACM J. Exp. Algorithmics 4: 3 (1999) - [c21]Shai Rubin, David Bernstein, Michael Rodeh:
Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures. CC 1999: 259-273 - [c20]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. WADS 1999: 181-192 - 1998
- [j20]Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
A Logic-Based Approach to Program Flow Analysis. Acta Informatica 35(6): 457-504 (1998) - [c19]Nurit Dor, Michael Rodeh, Shmuel Sagiv:
Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience). PASTE 1998: 27-34 - [c18]Nadav Eiron, Michael Rodeh, Iris Steinwarts:
Matrix Multiplication: A Case Study of Algorithm Engineering. WAE 1998: 98-109 - 1992
- [c17]David Bernstein, Michael Rodeh, Shmuel Sagiv:
Proving Safety of Speculative Load Instructions at Compile Time. ESOP 1992: 56-72 - [e1]Danny Dolev, Zvi Galil, Michael Rodeh:
Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa, Israel, May 1992. Lecture Notes in Computer Science 601, Springer 1992, ISBN 3-540-55553-6 [contents] - 1991
- [c16]David Bernstein, Michael Rodeh:
Global Instruction Scheduling for Superscalar Machines. PLDI 1991: 241-255 - 1990
- [j19]Alon Itai, Michael Rodeh:
Symmetry breaking in distributed networks. Inf. Comput. 88(1): 60-87 (1990) - [c15]Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
A Logic-Based Approach to Data Flow Analysis Problem. PLILP 1990: 277-292
1980 – 1989
- 1989
- [j18]David Bernstein, Michael Rodeh, Izidor Gertner:
Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines. J. Algorithms 10(1): 120-139 (1989) - [j17]David Bernstein, Jeffrey M. Jaffe, Michael Rodeh:
Scheduling Arithmetic and Load Operations in Parallel with No Spilling. SIAM J. Comput. 18(6): 1098-1127 (1989) - [j16]David Bernstein, Michael Rodeh, Izidor Gertner:
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines. IEEE Trans. Computers 38(9): 1308-1313 (1989) - [c14]Jacob P. Ukelson, Michael Rodeh:
A dialogue manager for efficient adaptive man-machine dialogues. COMPSAC 1989: 588-595 - [c13]Shmuel Sagiv, Orit Edelstein, Nissim Francez, Michael Rodeh:
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. POPL 1989: 36-48 - 1988
- [j15]Alon Itai, Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks. Inf. Comput. 79(1): 43-59 (1988) - [c12]Uri Shani, Michael Rodeh, Alan J. Wecker, Ike Sagie:
FLAME - An Efficient Access Method for Optical Disks. RIAO 1988: 227-236 - 1987
- [c11]David Bernstein, Jeffrey M. Jaffe, Michael Rodeh:
Scheduling Arithmetic and Load Operations in Parallel with No Spilling. POPL 1987: 263-273 - 1985
- [j14]Alon Itai, Michael Rodeh:
Scheduling Transmissions in a Network. J. Algorithms 6(3): 409-429 (1985) - [c10]David Bernstein, Ron Y. Pinter, Michael Rodeh:
Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses. POPL 1985: 325-333 - 1984
- [c9]Alon Itai, Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks. FOCS 1984: 137-147 - 1983
- [c8]Liuba Shrira, Nissim Francez, Michael Rodeh:
Distributed k-Selection: From a Sequential to a Distributed Algorithm. PODC 1983: 143-153 - 1982
- [j13]Alon Itai, Michael Rodeh:
Representation of Graphs. Acta Informatica 17: 215-219 (1982) - [j12]Danny Dolev
, Maria M. Klawe, Michael Rodeh:
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle. J. Algorithms 3(3): 245-260 (1982) - [j11]Michael Rodeh:
Finding the Median Distributively. J. Comput. Syst. Sci. 24(2): 162-166 (1982) - [j10]Michael Rodeh:
A fast test for unique decipherability based on suffix trees. IEEE Trans. Inf. Theory 28(4): 648-651 (1982) - [j9]Nissim Francez, Michael Rodeh:
Achieving Distributed Termination without Freezing. IEEE Trans. Software Eng. 8(3): 287-292 (1982) - 1981
- [j8]David Steinberg, Michael Rodeh:
A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area. Inf. Process. Lett. 12(2): 83-88 (1981) - [j7]Michael Rodeh, Vaughan R. Pratt, Shimon Even:
Linear Algorithm for Data Compression via String Matching. J. ACM 28(1): 16-24 (1981) - [j6]Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh:
Covering Graphs by Simple Circuits. SIAM J. Comput. 10(4): 746-750 (1981) - [j5]David Steinberg, Michael Rodeh:
A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area. IEEE Trans. Computers 30(12): 977-982 (1981) - [c7]Alon Itai, Michael Rodeh:
Symmetry Breaking in Distributive Networks. FOCS 1981: 150-158 - [c6]Alon Itai, Alan G. Konheim, Michael Rodeh:
A Sparse Table Implementation of Priority Queues. ICALP 1981: 417-431 - [c5]N. Frances, Michael Rodeh, Michel Sintzoff:
Distributed Termination with Interval Assertions. ICFPC 1981: 280-291 - 1980
- [j4]Shmuel Katz, Lawrence J. Risman, Michael Rodeh:
A System for Constructing Linear Programming Models. IBM Syst. J. 19(4): 505-520 (1980) - [c4]Nissim Francez, Michael Rodeh:
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme. FOCS 1980: 373-379
1970 – 1979
- 1979
- [c3]Emanuel Gofman, Michael Rodeh:
Designing efficient algorithms for APL: A case study of a hydraulic-network solver. APL 1979: 19-23 - 1978
- [j3]Shimon Even, Michael Rodeh:
Economical Encoding of Commas Between Strings. Commun. ACM 21(4): 315-317 (1978) - [j2]Alon Itai, Michael Rodeh, Steven L. Tanimoto:
Some Matching Problems for Bipartite Graphs. J. ACM 25(4): 517-525 (1978) - [j1]Alon Itai, Michael Rodeh:
Finding a Minimum Circuit in a Graph. SIAM J. Comput. 7(4): 413-423 (1978) - [c2]Alon Itai, Michael Rodeh:
Covering a Graph by Circuits. ICALP 1978: 289-299 - 1977
- [c1]Alon Itai, Michael Rodeh:
Some Matching Problems. ICALP 1977: 258-268
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: