[34] | Bard Bloom, Sorin Istrail, Albert R. Meyer, "Bisimulation can't be traced", In Journal of the ACM, vol. 42, no. 1, pp. 232-268, 1995.
[bib] [pdf] |

1994 | |

[33] | Dejan Zivkovic, Sorin Istrail, "Bounded-width polynomial size Boolean formulas compute exactly those functions from AC^0", In Information Processing Letters, vol. 50, no. 4, pp. 211-216, 1994.
[bib] [pdf] |

[32] | David Greenberg, Sorin Istrail, "The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data", In Computers and Chemistry, vol. 18, no. 3, pp. 207-220, 1994.
[bib] [pdf] |

1993 | |

[31] | Sorin Istrail, Dejan Zivkovic, "A non-probabilistic switching lemma for the Sipser function", In 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS93), Springer, vol. 665, pp. 566-575, 1993.
[bib] [pdf] |

[30] | Sorin Istrail, "The Chimeric Clones Problem", Sandia Labs, 1993. [bib] |

1991 | |

[29] | J Zipoli, Sorin Istrail, "On the impossibility of the crossover method for proving NP-completeness of the planar chromatic index problem", Wesleyan University, 1991. [bib] |

1990 | |

[28] | Sorin Istrail, "Constructing generalized universal traversing sequences of polynomial size for graphs of small diameter", In 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS90), IEEE Computer Society Press, pp. 439-448, 1990.
[bib] [pdf] |

[27] | Sorin Istrail, "On the complexity of unpredictability", Wesleyan University, 1990. [bib] |

[26] | Bard Bloom, Sorin Istrail, Albert R. Meyer, "Bisimulation can't be traced", In 15th Annual ACM Symposium on Principles of Programming Languages (POPL88), ACM Press, pp. 229-239, 1990.
[bib] [pdf] |

1989 | |

[25] | Sorin Istrail, "An arithmetical hierarchy in propositional dynamic logic", In Information and Computation, vol. 81, no. 3, pp. 280-289, 1989.
[bib] [pdf] |

1988 | |

[24] | Sorin Istrail, "An algorithm for embedding planar graphs in six pages", In Iasi University Annals, Mathematics-Computer Science, vol. 34, no. 4, pp. 329-341, 1988.
[bib] |

[23] | Sorin Istrail, "Polynomial universal traversing sequences for cycles are constructible", In 20th Annual ACM Symposium on Theory of Computing (STOC88), ACM Press, pp. 453-491, 1988.
[bib] [pdf] |

1987 | |

[22] | Lenwood S. Heath, Sorin Istrail, "The pagenumber of genus g graphs is O(g)", In 19th Annual ACM Symposium on Theory of Computing (STOC87), ACM Press, pp. 388-397, 1987.
[bib] [pdf] |

1983 | |

[21] | Cristian Masalagiu, Sorin Istrail, "Nivat's processing systems: decision problems related to protection and synchronization", In Theoretical Computer Science, vol. 26, pp. 83-103, 1983.
[bib] [pdf] |

[20] | Cristian Masalagiu, Sorin Istrail, "On protection in Nivat processing systems", In Colloquium of Automata and Programming (CAAP83), Springer, vol. 159, New York, pp. 255-268, 1983.
[bib] |

1982 | |

[19] | Nguyen Xuan My, Sorin Istrail, "N-contextual schemes", In Bulletin Mathematique, vol. Tome 26 (74), no. 3, pp. 241-249, 1982.
[bib] |

[18] | Sorin Istrail, "Some remarks on non-algebraic adherences", In Theoretical Computer Science, vol. 21, pp. 341-349, 1982.
[bib] [pdf] |

[17] | Sorin Istrail, "Generalizations of Ginsburg-Rice-Schutzenberger fixed-point theorem for context-sensitive and recursive-enumerable sets", In Theoretical Computer Science, vol. 18, pp. 333-341, 1982.
[bib] |

1981 | |

[16] | Cristian Masalagiu, Sorin Istrail, "Decision problems for languages associated with protection of systems", In Automatic Systems and Informatics, Polytechnic Institute of Bucharest, pp. 306-312, 1981.
[bib] |

[15] | Sorin Istrail, "On a linear theory of recursive-enumerable sets", In Series in Mathematics, Inst. de Mat., vol. 38 Increst, Bucharest, pp. 20, 1981.
[bib] |

[14] | Sorin Istrail, "Chomsky-Schutzenberger representations for families of languages and grammatical types", In International Conference on Automata, Languages and Programming (ICALP81), Springer, vol. 115, New York, pp. 333-347, 1981.
[bib] [pdf] |

1980 | |

[13] | L Olaru, Sorin Istrail, "An efficient data-structure for computer-graphics", In Artificial Intelligence and Information Control Systems of Robots, Slovak Academy of Sciences, pp. 83-85, 1980.
[bib] |

[12] | Sorin Istrail, "A fixed-point approach to contextual languages", In Revue Roumaine de Mathematiques Pures et Appliquees, vol. 25, no. 6, pp. 861-869, 1980.
[bib] |

1979 | |

[11] | Sorin Istrail, "On complements of some bounded context-sensitive languages", In Information and Control, vol. 42, no. 3, pp. 283-289, 1979.
[bib] |

[10] | Sorin Istrail, "On the complexity of program divergence", In Foundations of Control Engineering, vol. 4, no. 1, pp. 19-26, 1979.
[bib] |

Powered by bibtexbrowser