<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-001-12-0821</article-id>
      <article-id pub-id-type="publisher-id">27200</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Markov Process for Sequential Allocation</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Stefanescu</surname>
            <given-names>Calina</given-names>
          </name>
          <email xlink:type="simple">calina_stefanescu@fake_email.com</email>
        </contrib>
      </contrib-group>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Calina Stefanescu (<email xlink:type="simple">calina_stefanescu@fake_email.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1995</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>12</month>
        <year>1995</year>
      </pub-date>
      <volume>1</volume>
      <issue>12</issue>
      <fpage>821</fpage>
      <lpage>827</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/2E3E1109-1E7A-5AD7-98E1-568624251071">2E3E1109-1E7A-5AD7-98E1-568624251071</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995182">6995182</uri>
      <permissions>
        <copyright-statement>Calina Stefanescu</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>We describe a Markov process which models the sequential allocation for two adjacent tables coexisting in memory by growing towards each other. The tables are expected to fill at the same rate, random deletions and insertions are allowed.  1.) 1991 Mathematics Subject Classification. Primary 60J20, Secondary 62M05, 68P05.</p>
      </abstract>
    </article-meta>
  </front>
</article>
