1. An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements, J. Comb. Theory, (A) 19 (1975), 109-112. pdf
  2. The Equivalence of Theorem Proving and the Interconnection Problem, ACM SIGDA Newsletter 5 (1975), 31-36. pdf
  3. (with J. Mycielski), Advanced Problem 6233, American Math. Monthly 85 (1978), 686.
  4. Almost Sure Theories, Ann. Math. Logic 18 (1980), 91-135. pdf
  5. The Visually Distinct Configurations of k Sets, Discrete Math. 33 (1981), 281-287. pdf
  6. On Sets of Relations Definable by Addition, J. Symbolic Logic 47 (1982), 659-668. pdf
  7. Complexity Classes and Theories of Finite Models, Math. Systems Theory 15 (1982), 127-144.
  8. Probabilities of First-Order Sentences about Unary Functions, Transactions of the AMS 287 (1985), 543-568. pdf
  9. Enumeration of Taxonomic Classes of Sets, Congressus Numerantium 47 (1985), 315-316.
  10. (with M. Goldberg) Lower and Upper Bounds for the Bisection Width of a Random Graph, Congressus Numerantium 49 (1985), 19-25.
  11. A Depth-Size Tradeoff for Boolean Circuits with Unbounded Fan-In, Structure in Complexity Theory, Lecture Notes in Computer Science 223, Springer-Verlag, Berlin, Heidelberg, New York (1986), 234-248.
  12. (with V. Bedian, M. Roberts, and F. Zhang) A Neural Network Model with Applications to Pleurobranchaea, Soc. Neurosci. Abstr. 14 (1988), 259.
  13. (with V. Bedian and F. Zhang) A Neural Net Editor with Biological Applications, Proc. International Joint Conference on Neural Networks, Vol. I, Lawrence Erlbaum Associates, Hillsdale, N.J. (1990), 35-38.
  14. Taxonomic Classes of Sets, J. Comb. Theory, (A) 55 (1990), 143-152. pdf
  15. (with V. Bedian, M. Roberts, and F. Zhang) A Biologically Realistic and Efficient Neural Network Simulator, in Neural and Intelligent Systems Integration, Branko Souček, ed., Wiley-Interscience, New York (1991), 37-69.
  16. Probabilities of Sentences about Very Sparse Random Graphs, Random Struct. Alg. 3 (1992), 33-53.
  17. The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity, Comput. Complexity 2 (1992), 40-66.
  18. Convergence Laws for Random Words, Australasian J. of Combinatorics 7 (1993), 145-156. pdf
  19. (with P. Dolan) The Logic of Ordered Random Structures, Random Struct. Alg. 4 (1993), 429-445.
  20. Antichaos in a Class of Random Boolean Cellular Automata, Physica D 69 (1993), 201-208. pdf
  21. A Criterion for Stability in Random Boolean Cellular Automata, Ulam Quarterly 2 (1993), 32-44. pdf ps
  22. Threshold Functions for Markov Chains: a Graph Theoretic Approach, Combinatorics, Probability and Computing 2 (1993), 351-362.
  23. An Extension of 0-1 Laws, Random Struct. Alg. 5 (1994), 155-172.
  24. Random Resource Allocation Graphs and the Probability of Deadlock, SIAM J. Discrete Math. 7 (1994), 458-473.
  25. A Phase Transition in Random Boolean Networks, in Artificial Life IV, Rodney A. Brooks and Pattie Maes, eds., The MIT Press, Cambridge, MA (1994), 236-245.
  26. On the Threshold of Chaos in Random Boolean Cellular Automata, Random Struct. Alg. 6 (1995), 239-260.
  27. (with J. Tyszkiewicz) The Infinitary Logic of Sparse Random Graphs, Proc. Tenth Ann. IEEE Symp. on Logic in Computer Science (1995), 46-53.
  28. A Relation between Complexity and Entropy, Ulam Quarterly 3 (1995), 7-14. pdf ps
  29. Pebble Games in Model Theory, Structures in Logic and Computer Science, Lecture Notes in Computer Science 1261, J. Mycielski, G. Rozenberg, and A. Salomaa, eds., Springer-Verlag, Berlin, Heidelberg, New York (1997), 66-83.
  30. Editor (with R. Boppana), Logic and Random Structures, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33, American Mathematical Society (1997).
  31. Infinitary Logics and Very Sparse Random Graphs, J. Symbolic Logic 62 (1997), 609-623. pdf
  32. Special Year on Logic and Algorithms tutorial notes: Random finite models, DIMACS Tech. Report 97-56 (1997). pdf ps
  33. Convergence Laws for Random Graphs, Logic Colloquium '95, Lecture Notes in Logic 11, J. Makowsky and E. Ravve, eds., Springer-Verlag, Berlin, Heidelberg, New York (1998), 115-133.
  34. Critical Points for Random Boolean Networks, Physica D 172 (2002), 49-64. pdf
  35. Analysis and Application of Adaptive Sampling, J. Comp. Sys. Sci. 66 (2003), 2-19. pdf
  36. Convergence Law for Random Graphs with Specified Degree Sequence, ACM Trans. Computational Logic 6 (2005), 727-748. pdf
  37. Dynamics of Random Boolean Networks, Current Developments in Mathematical Biology, Proceedings of the Conference on Mathematical Biology and Dynamical Systems, K. Mahdavi, R. Culshaw, and J. Boucher, eds., World Scientific Publishing Co. (2007), 15-38. pdf
  38. A Logical Characterization of Individual-Based Models, Proc. 23rd Ann. IEEE Symp. on Logic in Computer Science (2008), 379-390. (pdf)
  39. (with O. Kahramanoğulları and F. Jordán) CoSBiLab LIME: A Language Interface for Stochastic Dynamical Modelling in Ecology, Environmental Modelling & Software 26 (2011), 685-687.
  40. (with O. Kahramanoğulları and C. Priami) Algorithmic Systems Ecology: Experiments on Multiple Interaction Types and Patches, InSuEdu 2012, Lecture Notes in Computer Science 7991, A. Cerone et al., eds., Springer (to appear 2014). (pdf)
  41. (with O. Kahramanoğulları) Stochastic flux analysis of chemical reaction networks, BMC Systems Biology 7 (2013), 133.
  42. (with O. Kahramanoğulları) A Theory of Model Equivalence, Essays for the Luca Cardelli Fest, M. Abadi, P. Gardner, A. D. Gordon, and R. Mardare, eds, Tech Report MSR-TR-2014-104, Microsoft Research (2014), 141-154. pdf