This site is supported by donations to The OEIS Foundation.

CiteO

From OeisWiki

Jump to: navigation, search


Contents

CiteO

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • This section lists works in which the first author's name begins with the letter O.
  • The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
  • For further information, see the main page for Works Citing OEIS.


References

  1. M. J. O'Brien, De Bruijn Graphs and The Ehrenfeucht-Mycielski Sequence, Master's Thesis, Carnegie Mellon University, April 26, 2001.
  2. Colm O'Dunlaing, In-order traversal of splay trees, Electronic Notes in Theoretical Computer Science, Volume 74, October 2003, Pages 134-157.
  3. J. R. Oaks, An Improved Approximate-Bayesian Model-choice Method for Estimating Shared Evolutionary History, arXiv preprint arXiv:1402.6303, 2014
  4. Mustafa Obaid et al., The number of complete exceptional sequences for a Dynkin algebra, arXiv preprint arXiv:1307.7573, 2013
  5. M. A. A. Obaid, S. K. Nauman, W. M. Fakieh, C. M. Ringel, The numbers of support-tilting modules for a Dynkin algebra, http://www.math.uni-bielefeld.de/~ringel/opus/jeddah.pdf, 2014.
  6. Edwin O'Shea, M-partitions: Optimal partitions of weight for one scale pan (2003), arXiv:math/0311230.
  7. N. Ochiumi, On the total sum of number of nodes covering a given number of leaves in an unordered binary tree; PDF.
  8. Adrian Ocneanu, On the inner structure of a permutation: bicolored partitions and Eulerians, trees and primitives; arXiv preprint arXiv:1304.1263, 2013
  9. A. M. Odlyzko, Asymptotic enumeration methods, in Handbook of Combinatorics, vol. 2, R. L. Graham, M. Groetschel and L. Lovasz, eds., Elsevier, 1995, pp. 1063-1229. (ps, PDF).
  10. A. M. Odlyzko, The rapid evolution of scholarly communication, Learned Publishing, Volume 15 no. 1, pp. 7-19.
  11. A. M. Odlyzko, Review of "Experimental Mathematics in Action by D. H. Bailey, J. M. Borwein, N. J. Calkin, R. Girgensohn, D. R. Luke and V. H. Moll. AK Peters, Wellesley, MA, 2007. xii+ 322 pp." See http://www.dtc.umn.edu/~odlyzko/misc/experimental-math.pdf. Published in Amer. Math. Monthly, 118 (2011), 946-951.
  12. J. Ofverstedt, Water Retention on Magic Squares with Constraint-Based Local Search, Department of Information Technology, Uppsala University, Report IT 12 018, June 2012.
  13. F. E. Oggier, G. F. Royle, N. J. A. Sloane, I. M. Wanless, H. S. Wilf, Acyclic digraphs and eigenvalues of (0,1)-matrices, J. Int. Seq. 79 (2004) # 04.3.3
  14. J. M. Oh, An explicit formula for the number of fuzzy subgroups of a finite abelian p-group of rank two, Iranian Journal of Fuzzy Systems, Dec 2013, Vol. 10 Issue 6, pp. 125-135.
  15. H. Ohtsuka, S. Nakamura A new formula for the sum of the sixth powers of Fibonacci numbers, vixra:0910.0012
  16. Okhotin, Alexander Unambiguous finite automata over a unary alphabet. Inform. and Comput. 212 (2012), 15-36.
  17. Gloria Olive, Catalan numbers revisited, Journal of Mathematical Analysis and Applications, Volume 111, Issue 1, October 1985, Pages 201-235.
  18. K. Oliver and H. Prodinger, The continued fraction expansion of Gauss' hypergeometric function and a new application to the tangent function, Transactions of the Royal Society of South Africa, Vol. 76 (2012), 151-154, doi:10.1080/0035919X.2012.727363.
  19. A. M. Oller-Marcen, On arithmetic numbers, Arxiv preprint arXiv:1206.1823, 2012
  20. R. L. Ollerton and A. G. Shannon, Extensions of generalized binomial coefficients, QM&MS Research Reports (2001).
  21. J. B. Olsson, Side 9-sætningen: En sætning om partitioner, Famøs Fagblad for Aktuar, Matematik, Økonomi og Statistik, 16. årgang, nr. 2, dec. 2002.
  22. Mihai Oltean, Solving the Hamiltonian path problem with a light-based computer (2007), arXiv:0708.1512; Natural Computing, Volume 7, Number 1 / March, 2008.
  23. Mihai Oltean and Oana Muntean, Exact Cover with light (2007), arXiv:0708.1962; New Generation Computing, Volume 26, Number 4 / August, 2008.
  24. Omey, Edward; Van Gulck, Stefan, On the number of orderings of n items. Bull. Belg. Math. Soc. Simon Stevin 14 (2007), no. 2, 229-237.
  25. J. D. Onera and F. Smarandache, An introduction to DSmT for information fusion, New Mathematics and Natural Computation, Volume 08, Issue 03, November 2012, doi:10.1142/S179300571250007X
  26. Lawrence Ong, Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers, arXiv preprint arXiv:1401.7369, 2014
  27. Onofri, E.; Veneziano, G.; Wosiek, J. Supersymmetry and combinatorics. Comm. Math. Phys. 274 (2007), no. 2, 343-355.
  28. F. Oort, Prime numbers, 2013, PDF
  29. A. Orbanic et al., A note on enumeration of one-vertex maps, ARS MATHEMATICA CONTEMPORANEA, 3 (2010) 1-12 HTML
  30. E. Ordentlich and R. M. Roth, The Asymptotic Capacity of Multi-Dimensional Runlength-Limited Constraints and Independent Sets in Hypergraphs, HP Labs 2002 Technical Report.
  31. Ordentlich, Erik; Roth, Ron M., Independent sets in regular hypergraphs and multidimensional runlength-limited constraints. SIAM J. Discrete Math. 17 (2004), no. 4, 615-623 .
  32. Erik Ordentlich, Ron M. Roth, Gadiel Seroussi, On q-ary Antipodal Matchings and Applications, 2012; http://www.hpl.hp.com/techreports/2012/HPL-2012-113.pdf.
  33. Orellana, Rosa C. On partition algebras for complex reflection groups. J. Algebra 313 (2007), no. 2, 590-616.
  34. Orlitsky, Alon; Santhanam, Narayana P. Speaking of infinity. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2215-2230.
  35. Orlitsky, Alon; Santhanam, Narayana P.; Zhang, Junan, Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inform. Theory 50 (2004), no. 7, 1469-1481.
  36. M. Ortolano, M. Abrate, L. Callegaro, On the synthesis of Quantum Hall Array Resistance Standards, arXiv preprint arXiv:1311.0756, 2013
  37. R. Osburn, Research Statement.
  38. Robert Osburn and Brundaban Sahu, A supercongruence for generalized Domb numbers, http://maths.ucd.ie/~osburn/superdomb.pdf.
  39. Osburn, Robert; Sahu, Brundaban Supercongruences for Apéry-like numbers. Adv. in Appl. Math. 47 (2011), no. 3, 631-638.
  40. Wilbert Osmond, Growing Trees in Padovan Sequence For The Enhancement of L-System Algorithm, http://cys.or.id/docs/icys2014_abstract_wilbert_osmond.pdf, 2014.
  41. P. R. J. Ostergard and V. H. Pettersson, Enumerating Perfect Matchings in n-Cubes, PDF, doi:10.1007/s11083-012-9279-8, Oder 30 (2013) 821-835.
  42. P. R. J. Ostergard and H. Ville, Exhaustive Search for Snake-in-the-Box Codes, Preprint, PDF doi:10.1007/s00373-014-1423-3, Graphs and Combinatorics, May 2014
  43. J. A. Oteo and J. Ros, "A Fractal Set from the Binary Reflected Gray Code", J. Phys. A: Math Gen. 38 (2005) 8935-8949
  44. Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira and Ling Cheng, Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes, Designs, Codes and Cryptography, Volume 48, Number 2 / August, 2008.
  45. Sergei Ovchinnikov, Discrete piecewise linear functions (2008); arXiv:0807.3364

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • This section lists works in which the first author's name begins with the letter O.
  • The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
  • For further information, see the main page for Works Citing OEIS.
Retrieved from "http://oeis.org/wiki/CiteO"
Personal tools