Sorin Istrail's Homepage :: Publications

  1. B. Halldorsson, D. Aguiar, S. Istrail, Haplotype Phasing by Multi-Assembly of Shared Haplotypes: Phase-Dependent Interactions Between Rare Variants, presented at the Pacific Symposium on Biocomputing, Big Island, Hawaii, January 3-7, 2011.

  2. S. Istrail, R. Tarpine, K. Schutter, and D. Aguiar, Practical Computational Methods for Regulatory Genomics: A cis-Lexicon and cis-Browser for Gene Regulatory Networks, In I. Ladunga (ed.) Computational Biology of Transcription Factor Binding,Methods in Molecular Biology 674, DOI 10.1007/978-1-60761-854-6_22, Springer Science+Business Media, LLC, Humana Press, 2010

  3. B. Halldorsson, D. Aguiar, R. Tarpine, S. Istrail, The Clark Phase-able Sample Size Problem: Long-range Phasing and Loss of Heterozygosity in GWAS, Journal of Computation Biology, March 2011, 18(3): 323-33

  4. J. Nam, P. Dong, R. Tarpine, S. Istrail and E. Davidson, Functional cis-regulatory genomics for systems biology, Proceedings of the National Academy of Sciences, vol. 107, no. 8, pp. 3930-3935, 2010

  5. F. Lam, R. Tarpine and S. Istrail, The Imperfect Ancestral Recombination Graph Reconstruction Problem: A Hierarchy of Upper Bounds, Journal of Computational Biology, vol. 17, no. 6, pp. 767-781, 2010

  6. S. Istrail, P. Pevzner, R. Shamir, F. Sun (Editors), Special Issue Dedicated to Michael Waterman on the Occasion of his 67th Birthday: Parts III-IV, Communications in Information and Systems, China, vol. 10, nos. 3-4, pp. 1-115, 2010

  7. Tarpine, R., Istrail, S. On the Concept of Cis-Regulatory Information: From Sequence Motifs to Logic Functions. Algorithmic Bioprocesses, Springer-Verlag, Berlin Heidelberg, pp. 731-742, 2009

  8. S. Istrail, P. Pevzner, R. Shamir, F. Sun (Editors), Special Issue Dedicated to Michael Waterman on the Occasion of his 67th Birthday: Parts I-II, Communications in Information and Systems, China, vol. 9, nos. 1-2, pp. 235-347, 2009

  9. S. Istrail, F. Lam, Combinatorial Algorithms for Protein Folding in Lattice Models: A Survey of Mathematical Results, Communications in Information and Systems, vol. 9, no. 4, pp. 303-346, 2009

  10. F. Lam and S, Istrail, Combinatorial Algorithms for Protein Folding in Lattice Models: A Survey of Mathematical Results to appear in Communications in Information and Systems Journal  (2009), China

  11. S. Istrail, S. Ben-Tabou de-Leon, E.H. Davidson, The Regulatory Genome and the Computer, Developmental Biology, vol 310, pp. 187-195, 2007

  12. Manoj P. Samanta, Waraporn Tongprasit, Sorin Istrail, R. Andrew Cameron, Qiang Tu, Eric H. Davidson, Viktor Stolc, The Transcriptome of the Sea Urchin Embryo, Science, vol. 314, pp. 960-962 November, 2006
  13. R. Sharan, B. Halldorsson, S. Istrail, Islands of Tractability for Parsimony Haplotyping, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, 303-311, 2006

  14. E. Sodergren, G. Weinstock, E. Davidson, ...S. Istrail,... The Genome of the Sea Urchin Strongylocentrotus purpuratus, Science, vol 314., pp. 941-952, November, 2006

  15. S. Istrail and E. Davidson, Logic functions of the genomic cis-regulatory code, Proceedings of the National Academy of Sciences, vol. 102, No. 14, 4954-4959, 2005
  16. Bjarni Halldorsson, Roded Sharan, and Sorin Istrail, Islands of Tractability for Parsimony Haplotyping, Proceedings of the Stanford Computational Systems Biology, pp. 65-72 (IEEE/ACM Transactions on Computational Biology and Bioinformatics, in press.), 2005
  17. Francisco M. De La Vega, Hadar Isaac, Andrew Collins, Charles R. Scafe, Bjarni V. Halldrsson, Xiaoping Su, Ross A. Lippert, Francis Kalush, Stephen J. O'Brian, Andrew Clark, Sorin Istrail, Michael W. Hunkapiller, Eugene G. Spier, and Dennis Gilbert, The linkage disequilibrium maps of three human chromosomes across four populations reflect their demographic history and a common underlying recombination pattern. Genome Research, March 21, 2005

  18. Florea, L., V. Di Francesco, J. Miller, R. Turner, C. Mobarry, A. Yao, M. Harris, B. Walenz, I. Dew, G. Merkulov, R. Charlab, Z. Deng, S. Istrail, P. Li, G. Sutton, Gene and alternative splicing annotation with AIR, Genome Research 15(1), 54-66, 2005

  19. A. Caprara, R. Carr, S. Istrail, G. Lancia, and B. Walenz, 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap}, Journal of Computational Biology, vol 11, No. 1, pp 27-52, 2004

  20. Bjarni V. Halldorsson, Vineet Bafna, Ross Lippert, Russell S. Schwartz, Francisco M. De La Vega, Andrew G. Clark, Sorin Istrail, Optimal haplotype block free selection of tagging SNPs for genome-wide association studies, Genome Research, August, 2004

  21. Sorin Istrail, Liliana Florea, Bjarni V. Halld\'orsson, Oliver Kohlbacher, Russell S. Schwartz, Von Bing Yap, Jonathan Yewdell, Stephen Hoffman, Comparative Immuno-Peptidomics of Humans and their Pathogens, Proceedings of the National Academy of Sciences, 2004.

  22. Sorin Istrail, Granger G. Sutton, Liliana Florea, Aaron L. Halpern, Clark M. Mobarry, Ross Lippert, Brian Walenz, Hagit Shatkay, Ian Dew, Jason R. Miller, Michael J. Flanigan, Nathan J. Edwards, Randall Bolanos, Daniel Fasulo, Bjarni V. Halldorsson, Sridhar Hannenhalli, Russell Turner, Shibu Yooseph, Fu Lu, Deborah R. Nusskern, Bixiong Chris Shue, Xiangqun Holly Zheng, Fei Zhong, Arthur L. Delcher, Daniel H. Huson, Saul A. Kravitz, Laurent Mouchard, Knut Reinert, Karin A. Remington, Andrew G. Clark, Michael S. Waterman, Evan E. Eichler, Mark D. Adams, Michael W. Hunkapiller, Eugene W. Myers, J. Craig Venter Whole Genome Shotgun Assembly and Comparison of Human Genome Assemblies, Proceedings of the National Academy of Sciences, 101:1916-21, 2004

  23. Lippert, R., X. Zhao, L. Florea, C. Mobarry, S. Istrail (2004), Finding anchors for genomic sequence comparison, Proceedings of the 8th Annual International Conference on Research in Computational Biology (RECOMB04), ACM Press 2004

  24. Vineet Bafna, Bjarni V. Halldorsson, Russell S. Schwartz, Andrew G. Clark, Sorin Istrail, Haplotypes and Informative SNP Selection Algorithms: Don't Block Out Information, , Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB03) , ACM Press, pp. 19-27, 2003

  25. Liliana Florea, Bjarni V. Halld\'{o}rsson, Oliver Kohlbacher, Russell S. Schwartz, Stephen Hoffman, Sorin Istrail, Epitope prediction algorithms for peptide-based vaccine design, Proceedings of the Second Annual IEEE Computer Society Bioinformatics Conference (CSB03), IEEE Press, pp. 17-26, 2003

  26. Liliana Florea, Bjarni V. Halldorsson, Oliver Kohlbacher, Russell S. Schwartz, Stephen Hoffman, Sorin Istrail, A Computational Pipeline for High-Throughput T-Cell Epitope Prediction, Celera Genomics Technical Report 2003

  27. Bjarni V. Halldorsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail, A survey of computational methods for determining haplotypes, Proceedings of the First RECOMB Satellite on Computational Methods for SNPs and Haplotype Inference, (RECOMB SNP\&HAP03), Springer Lecture Notes in Bioinformatics, LNBI 2983, pp. 26-47, 2003

  28. Bjarni V. Halld\'{o}rsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail, Combinatorial problems arising in SNP and haplotype analysis, Proceedings of the Fourth International Conference on Discrete Mathematics and Theoretical Computer Science, (CDMTCS03), Springer Lecture Notes in Computer Science, pp. 26-47, 2003

  29. Russell S. Schwartz, Bjarni V. Halldorsson, Vineet Bafna, Andrew G. Clark, Sorin Istrail Robustness of Inference of Haplotype Block Structure. Journal of Computational Biology, 10:13-19, 2003

  30. R. Schwartz, A. Clark, S. Istrail, Inferring piecewise ancestral sequences from haploid sequences, Proceedings of the First RECOMB Satellite on Computational Methods for SNPs and Haplotype Inference,(RECOMB SNP\&HAP03), Springer Lecture Notes in Bioinformatics, LNBI 2983, 2003

  31. S. Istrail,The Haplotype Phasing Problem ,Celera Genomics Technical Report 2002

  32. R. Lippert, R. Schwartz, G. Lancia, S. Istrail, Algorithmic Strategies for the SNP Haplotype Assembly Problem, Briefings in Bioinformatics, Vol 3. No 1, p. 1-9, March 2002

  33. Rizzi, R., V. Bafna, S. Istrail, G. Lancia, Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem, Proceeding of the 2nd Workshop on Algorithms in Bioinformatics, (WABI02), Springer Lecture Notes in Computer Science, 29-43, 2002

  34. Schwartz, R., A. Clark, S. Istrail, Methods for inferring block-wise ancestral history from haploid sequences: The haplotype coloring problem, Proceedings of the 2nd Workshop on Algorithms in Bioinformatics, (WABI02), Springer Lecture Notes in Computer Science, 44-59, 2002

  35. G. Lancia, R. Carr, B. Walenz, S. Istrail, 101 Optimal PDB Structure Alignments: A Branch-and-Cut Algorithm for the Maximum Contact Map Overlap Problem, Proceeding of the Fifth International Conference on Research on Computational Biology, (RECOMB01), ACM Press, p. 201-211, 2001

  36. G. Lancia, V. Bafna, S. Istrail, R. Lippert, R. Schwartz, SNPs Problems: Complexity and Algorithms, Proceedings of the 3rd European Symposium on Algorithms, (EAS01) Springer Lecture Notes in Computer Science, 2161, p. 182-193, 2001

  37. M. Li, R. Lippert, R. Schwartz, M. Waterman, S. Istrail, Haplotype Reconstruction from SNP Alignment, Celera Genomics, Technical Report 2001

  38. R. Schwartz, R., S. Istrail, J. King, Frequencies of amino-acid strings in globular proteins sequences indicate suppression of blocks of consecutive hydrophobic residues, Protein Science 10: 1023-1031, 2001

  39. R. Turner, K. Chaturvedi, N. Edwards, D. Fasulo, A. Halpern, D. Huson, O. Kohlbacher, J. Miller, K. Reinert, K. Remington, R. Schwartz, B. Walenz, S. Yooseph, S. Istrail, Visualization Challenges for a New Cyberpharmaceutical Computing Paradigm, Proceedings of the Symposium on Large-Data Visualization and Graphics, San Diego, California, October 22-23, 2001

  40. J. Craig Venter and M. D. Adams and E. W. Myers and P. Li and R. J. Mural and G. G. Sutton and H. O. Smith and M. Yandell and C. A. Evans and R. A. Holt and J. D. Gocayne and P. Amanatides and R. M. Ballew and D. H. Huson and J. Russo Wortman and Q. Zhang and C. Kodira and X. H. Zheng and L. Chen and M. Skupski and G. Subramanian and P. D. Thomas and J. Zhang and G. L. Gabor Miklos and C. Nelson and S. Broder and A. G. Clark and J. Nadeau and V. A. McKusick and N. Zinder and A. J. Levine and R. J. Roberts and M. Simon and C. Slayman and M. Hunkapiller and R. Bolanos and A. Delcher and I. Dew and D. Fasulo and M. Flanigan and L. Florea and A. Halpern and S. Hannenhalli and S. Kravitz and S. Levy and C. Mobarry and K. Reinert and K. Remington and J. Abu-Threideh and E. Beasley and K. Biddick and V. Bonazzi and R. Brandon and M. Cargill and I. Chandramouliswaran and R. Charlab and K. Chaturvedi and Z. Deng and V. Di Francesco and P. Dunn and K. Eilbeck and C. Evangelista and A. E. Gabrielian and W. Gan and W. Ge and F. Gong and Z. Gu and P. Guan and T. A. Heiman and M. E. Higgins and R-R. Ji and Z. Ke and K. A. Ketchum and Z. Lai and Y. Lei and Z. Li and J. Li and Y. Liang and X. Lin and F. Lu and G. V. Merkulov and N. Milshina and H. M. Moore and A. K Naik and V. A. Narayan and B. Neelam and D. Nusskern and D. B. Rusch and S. Salzberg and W. Shao and B. Shue and J. Sun and Z. Yuan Wang and A. Wang and X. Wang and J. Wang and M-H. Wei and R. Wides and C. Xiao and C. Yan and A. Yao and J. Ye and M. Zhan and W. Zhang and H. Zhang and Q. Zhao and L. Zheng and F. Zhong and W. Zhong and S. C. Zhu and S. Zhao and D. Gilbert and S. Baumhueter and G. Spier and C. Carter and A. Cravchik and T. Woodage and F. Ali and H. An and A. Awe and D. Baldwin and H. Baden and M. Barnstead and I. Barrow and K. Beeson and D. Busam and A. Carver and A. Center and M. Lai Cheng and L. Curry and S. Danaher and L. Davenport and R. Desilets and S. Dietz and K. Dodson and L. Doup and S. Ferriera and N. Garg and A. Gluecksmann and B. Hart and J. Haynes and C. Haynes and C. Heiner and S. Hladun and D. Hostin and J. Houck and T. Howland a. Chinyere Ibegwam and J. Johnson and F. Kalush and L. Kline and S. Koduru and A. Love and F. Mann and D. May and S. McCawley and T. McIntosh and I. McMullen and M. Moy and L. Moy and B. Murphy and K. Nelson and C. Pfannkoch and E. Pratts and V. Puri and H. Qureshi and M. Reardon and R. Rodriguez and Y-H. Rogers and D. Romblad and B. Ruhfel and R. Scott and C. Sitter and M. Smallwood and E. Stewart and R. Strong and E. Suh and R. Thomas and N. Ni Tint and S. Tse and C. Vech and G. Wang and J. Wetter and S. Williams and M. Williams and S. Windsor and E. Winn-Deen and K. Wolfe and J. Zaveri and K. Zaveri and J. F. Abril and R. Guigo " and M. J. Campbell and K. V. Sjolander and B. Karlak and A. Kejariwal and H. Mi and B. Lazareva and T. Hatton and A. Narechania and K. Diemer and A. Muruganujan and N. Guo and S. Sato and V. Bafna and S. Istrail and R. Lippert and R. Schwartz and B. Walenz and S. Yooseph and D. Allen and A. B. and J. Baxendale and L. Blick and M. Caminha and J. Carnes-Stine and P. Caulk and Y-H. Chiang and M. Coyne and C. Dahlke and A. Deslattes Mays and M. Dombroski and M. Donnelly and D. Ely and S. Esparham and C. Fosler and H. Gire and S. Glanowski and K. Glasser and A. Glodek and M. Gorokhov and K. Graham and B. Gropman and M. Harris and J. Heil and S. Henderson and J. Hoover and D. Jennings and C. Jordan and J. Jordan and J. Kasha and L. Kagan and C. Kraft and A. Levitsky and M. Lewis and X. Liu and J. Lopez and D. Ma and W. Majoros and J. McDaniel and S. Murphy and M. Newman and T. Nguyen and N. Nguyen and M. Nodell and S. Pan and J. Peck and W. Rowe and R. Sanders and J. Scott and M. Simpson and T. Smith and A. Sprague and T. Stockwell and R. Turner and E. Venter and M. Wang and M. Wen and D. Wu and M. Wu and A. Xia and A. Zandieh and X. Zhu, The {S}equence of the {H}uman {G}enome, Science, vol 291, pp.1145-1434, 2001

  41. D. Goldman, S. Istrail, G. Lancia, A. Piccolboni, B. Walenz, Algorithmic Strategies in Combinatorial Chemistry, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA00), ACM Press, January 2000.

  42. S. Istrail, Statistical Mechanics, Three-Dimensionality and NP-Completeness: I. Universality of Intractability of the Partition Functions of the Ising Model Across Non-Planar Lattices, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC00), ACM Press, p. 87-96, Portland, Oregon, May 21-23, 2000

  43. Sorin Istrail, Alan Hurd, Ross A. Lippert, Brian Walenz, Serafim Batzoglou, John H. Conway, Fredrick W. Peyerl. Prediction of Self-Assembly of Energetic Tiles and Dominos: Experiments, Mathematics and Software. Sandia Labs Technical Report, March 2000.

  44. S. Batzoglou, S. Istrail, Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem, Proceedings of the 10th Conference on Combinatorial Pattern Matching (CPM99), Springer Lectures Notes in Computer Science, Warwick, England, July 1999

  45. B. Carr, G. Lancia, S. Istrail, Branch-and-Bound LP-algorithms for Protein Structure Alignment Based on Contact Map Overlap, Sandia Labs Technical Report, 1999

  46. J. H. Conway, S. Istrail, Mathematics of Self-Assembly, Sandia Labs, Technical Report 1999

  47. D. Goldman, S. Istrail, C. Papadimitriou, Algorithmic Aspects of Protein Structure Similarity, Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS99), IEEE Computer Society Press, October 1999

  48. S. Istrail, R. Schwartz, J. King, Lattice Simulations of Aggregation Funnels of Protein Folding, Journal of Computational Biology, vol. 6, no. 2, 1999

  49. R. Lippert, S. Istrail, A. Hurd, Prediction of Energetic Tiles Self-Assembly, Sandia Labs Technical Report, 1999

  50. R. Schwartz, S. Istrail, J. King, Insights Into the Association of Partially Folded Chains Derived From Lattice Simulation Models, Sandia Labs, Technical Report, 1999

  51. S. Istrail, R. Ravi, What is a Good Objective for Multiple Sequence Alignment? Sandia Labs, Technical Report 1998

  52. S. Istrail, Multiple Sequence Alignment and Voting Paradoxes, Sandia Labs, Technical Report 1998

  53. W. E. Hart, S. Istrail, Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials, Journal of Computational Biology, Vol. 4, No. 1, pp. 1-22, 1997

  54. W. E. Hart, S. Istrail, Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86\% of Optimal (Extended Abstract), First International Conference on Computational Molecular Biology, (RECOMB97), ACM Press, January 20-23, pp. 137-146, 1997

  55. W. E. Hart, S. Istrail, Fast Protein Folding in the Hydrophobic-Hydrophilic Model Within Three-eighths of Optimal, Journal of Computational Biology, Vol. 3, Number 1, pp. 53-96, 1996

  56. W. E. Hart, S. Istrail, Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms, Proceedings of the 7th Conference on Combinatorial Pattern Matching (CPM96), Springer Lecture Notes in Computer Science, pp. 288-303, June 1996

  57. S. Istrail, Approximations Algorithms on Matroids Based on Cycle-Bases and Applications, Sandia Labs, Technical Report 1996

  58. B. Bloom, S. Istrail, A. R. Meyer, Bisimulation can't be traced, Journal of the ACM , Vol. 42, issue 1, pp. 232-268, January 1995

  59. D. S. Greenberg, S. Istrail, Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation, Journal of Computational Biology, Vol 2, Number 2, pp. 219-274, 1995

  60. W. E. Hart, S. Istrail, Fast Protein Folding in the Hydrophobic-Hydrophilic Model Within Three-eighths of Optimal (Extended Abstract), Proceedings of 27th Annual ACM Symposium on Theory of Computation (STOC95), ACM Press, pp. 157-168, 1995

  61. W. E. Hart, S. Istrail, Crystallographical universal approximation: A complexity theory of protein folding algorithms for crystal lattices, Sandia Labs, Technical Report 1995

  62. D.S. Greenberg and S. Istrail, The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data, Computers and Chemistry, Vol 18, No.3, pp. 207-220, 1994

  63. D. Zivkovic, S. Istrail, Bounded-width polynomial size Boolean formulas compute exactly those functions from $AC^0$, Information Processing Letters, 50(4):211-216, 1994

  64. S. Istrail, The Chimeric Clones Problem, Sandia Labs, Technical Report 1993

  65. D. Zivkovic, S. Istrail, A non-probabilistic switching lemma for the Sipser function}, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS93), Springer Lecture Notes in Computer Science, No.665, pp. 566-575, 1993

  66. J. Zipoli, S. Istrail, On the impossibility of the crossover method for proving NP-completeness of the planar chromatic index problem, Wesleyan University, Technical Report 1991

  67. S. Istrail, Constructing generalized universal traversal sequences of polynomial size for graphs of small diameter, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS90), IEEE Computer Society Press pp. 439-448, 1990

  68. S. Istrail, On the complexity of unpredictability, Wesleyan University, Technical Report 1990

  69. S. Istrail, An arithmetical hierarchy in propositional dynamic logic, Information and Computation, Vol 81, No. 3, pp. 280-289, 1989

  70. B. Bloom, S. Istrail, A. R. Meyer, Bisimulation can't be traced, Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL88), ACM Press, pp. 229-239, 1988

  71. S. Istrail, An algorithm for embedding planar graphs in six pages, Iasi University Annals, Mathematics-Computer Science, Vol. 34, No. 4, pp. 329-341, 1988

  72. S. Istrail, Polynomial universal traversal sequences for cycles are constructible, Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC88), ACM Press, pp. 491-453, 1988

  73. L. Heath, S. Istrail, The pagenumber of genus g graphs is O(g), Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC87)}, ACM Press, pp. 388-397, 1987

  74. C. Masalagiu, S. Istrail, Nivat's processing systems: decision problems related to protection and synchronization, Theoretical Computer Science, 26, pp. 83-103, 1983

  75. C. Masalagiu, S. Istrail, On protection in Nivat processing systems}, Proceedings of the Colloquium of Automata and Programming (CAAP83), Springer Lecture Notes in Computer Science, No. 159, New York, pp. 255-268, 1983

  76. S. Istrail, Some remarks on non-algebraic adherences}, Theoretical Computer Science, 21, pp. 341-349, 1982

  77. S. Istrail, Generalizations of Ginsburg-Rice-Schutzenberger fixed-point theorem for context-sensitive and recursive-enumerable sets, Theoretical Computer Science, No. 18, pp. 333-341, 1982

  78. N. Xuang My, S. Istrail, N-contextual schemes, Bulletin Mathematique, Tome 26 (74) No. 3, pp. 241-249, 1982

  79. S. Istrail, On a linear theory of recursive-enumerable sets, Series in Mathematics, No. 38 Increst, Bucharest, 22 pp., 1981

  80. S. Istrail, Chomsky-Schutzenberger representations for families of languages and grammatical types, Proceeding of the International Conference on Automata, Languages and Programming (ICALP81)} Springer Lecture Notes in Computer Science, No. 115, New York, pp. 333-347, 1981

  81. C. Masalagiu, S. Istrail, Decision problems for languages associated with protection of systems, Automatic Systems and Informatics, Polytechnic Institute of Bucharest, pp. 306-312, 1981

  82. S. Istrail, A fixed-point approach to contextual languages, Revue Roumaine de Mathematiques Pures et Appliquees, Vol. 25, No. 6, pp. 861-869, 1980

  83. L. Olaru, S. Istrail, An efficient data-structure for computer-graphics, Artificial Intelligence and Information Control Systems of Robots, ed. I. Plander, Slovak Academy of Sciences, pp. 83-85, 1980

  84. S. Istrail, On complements of some bounded context-sensitive languages, Information and Control, Vol. 42, No. 3, pp. 283-289, 1979

  85. S. Istrail, On the complexity of program divergence, Foundations of Control Engineering, Vol. 4, No. 1, pp. 19-26, 1979

  86. S. Istrail, A fixed-point theorem for recursive-enumerable languages and some considerations about semantics of monadic programs, Proceeding of the International Conference on Automata, Languages and programming (ICALP79), Springer Lecture Notes in Computer Science, No. 71, New York, pp. 289-303, 1979

  87. S. Istrail, Contextual grammars with regular choice, Studii si Cercetari Matematice, Vol. 30, No. 3, pp. 287-294, 1978

  88. S. Istrail, D. Simovici, Computing grammars and context-sensitive languages, Revue Francais D'Automatique, Informatique et Recherche Operationelle, Vol. 12, No. 1, pp. 33-48, 1978

  89. S. Istrail, A problem about contextual grammars with choice, Studii si Cercetari Matematice, Vol. 30, No. 4, pp. 401-408, 1978

  90. S. Istrail, Elementary bounded languages, Information and Control, Vol. 39, No. 2, pp. 177-191, 1978

  91. S. Istrail, On irreducible languages and nonrational numbers, Bulletin Mathematique, Vol 21, No. 3-4 pp. 301-308, 1977

  92. S. Istrail, On formal constructions of algebraic numbers of degree two}, Revue Roumaine de Mathematiques Pures et Appliquees}, Vol. 22, No. 9 pp. 1235-1239, 1977

  93. S. Istrail, On the weak equivalence problem of $OL$-systems with some generative devices, Iasi University Annals , Vol. 23, No. 2 pp. 419-422, 1977

  94. S. Istrail, On some symmetric operators on free semigroups, Studii si Cercetari Matematice, Vol. 28, No. 1, pp. 111-121, 1976

Home | Professional Experience | Honors | Publications | Editorial Work | Research Interests | Istrail Laboratory | ©2005 Sorin Istrail