Yury

Results: 296



#Item
41An expected polynomial time algorithm for coloring 2-colorable 3-graphs Yury Person 1,2 Mathias Schacht 2 Institut f¨ ur Informatik Humboldt-Universit¨

An expected polynomial time algorithm for coloring 2-colorable 3-graphs Yury Person 1,2 Mathias Schacht 2 Institut f¨ ur Informatik Humboldt-Universit¨

Add to Reading List

Source URL: www.math.uni-frankfurt.de

Language: English - Date: 2013-08-01 11:11:28
    42SPANNING STRUCTURES AND UNIVERSALITY IN SPARSE HYPERGRAPHS arXiv:1504.02243v2 [math.CO] 10 AprOLAF PARCZYK AND YURY PERSON

    SPANNING STRUCTURES AND UNIVERSALITY IN SPARSE HYPERGRAPHS arXiv:1504.02243v2 [math.CO] 10 AprOLAF PARCZYK AND YURY PERSON

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2015-04-12 21:50:43
      43AN EXPECTED POLYNOMIAL TIME ALGORITHM FOR COLORING 2-COLORABLE 3-GRAPHS YURY PERSON AND MATHIAS SCHACHT Abstract. We present an algorithm that for 2-colorable 3-uniform hy-

      AN EXPECTED POLYNOMIAL TIME ALGORITHM FOR COLORING 2-COLORABLE 3-GRAPHS YURY PERSON AND MATHIAS SCHACHT Abstract. We present an algorithm that for 2-colorable 3-uniform hy-

      Add to Reading List

      Source URL: www.math.uni-frankfurt.de

      Language: English - Date: 2013-08-01 11:12:43
        44An algorithmic framework for obtaining lower bounds for random Ramsey problems Rajko Nenadov1 Yury Person2

        An algorithmic framework for obtaining lower bounds for random Ramsey problems Rajko Nenadov1 Yury Person2

        Add to Reading List

        Source URL: arxiv.org

        Language: English - Date: 2014-08-24 20:37:15
          45Almost all hypergraphs without Fano planes are bipartite∗ Yury Person† Abstract The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is cont

          Almost all hypergraphs without Fano planes are bipartite∗ Yury Person† Abstract The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is cont

          Add to Reading List

          Source URL: www.math.uni-frankfurt.de

          Language: English - Date: 2013-08-01 11:11:37
            46Revista Científica CSSN “La Ciencia al Servicio de la Salud y Nutrición” Vol. 5, 2015 ISSN 1390-874X DIAGNÓSTICO de la obesidad mediante la antropometría nutricional. Una revisión. Rosales Ricardo Yury 1 1 Escue

            Revista Científica CSSN “La Ciencia al Servicio de la Salud y Nutrición” Vol. 5, 2015 ISSN 1390-874X DIAGNÓSTICO de la obesidad mediante la antropometría nutricional. Una revisión. Rosales Ricardo Yury 1 1 Escue

            Add to Reading List

            Source URL: cssn.espoch.edu.ec

            Language: Spanish - Date: 2015-11-26 10:10:08
              47SOA yield from ozonolysis of BVOC at varying NO2 concentrations Danielle Draper,1 Delphine Farmer,2 Yury Desyaterik,3 Juliane L. Fry1 1Chemistry Department, Reed College, Portland, OR. 2Chemistry Department, Colorado Sta

              SOA yield from ozonolysis of BVOC at varying NO2 concentrations Danielle Draper,1 Delphine Farmer,2 Yury Desyaterik,3 Juliane L. Fry1 1Chemistry Department, Reed College, Portland, OR. 2Chemistry Department, Colorado Sta

              Add to Reading List

              Source URL: www.reed.edu

              Language: English - Date: 2013-10-07 15:28:59
                48Mapping the Words Experimental visualizations of translation structures between Ancient Greek and Classical Arabic Torsten Roeder (Berlin/Würzburg) Yury Arzhanov (Bochum)

                Mapping the Words Experimental visualizations of translation structures between Ancient Greek and Classical Arabic Torsten Roeder (Berlin/Würzburg) Yury Arzhanov (Bochum)

                Add to Reading List

                Source URL: de.digitalclassicist.org

                - Date: 2016-04-01 04:53:03
                  49Approximation Algorithms and Hardness of the k-Route Cut Problem∗ Julia Chuzhoy† Yury Makarychev‡

                  Approximation Algorithms and Hardness of the k-Route Cut Problem∗ Julia Chuzhoy† Yury Makarychev‡

                  Add to Reading List

                  Source URL: ttic.uchicago.edu

                  Language: English - Date: 2011-12-15 13:20:22
                    501 Variable-length compression allowing errors Victoria Kostina, Member, IEEE, Yury Polyanskiy, Senior Member, IEEE, Sergio Verd´u, Fellow, IEEE, Abstract—This paper studies the fundamental limits of the

                    1 Variable-length compression allowing errors Victoria Kostina, Member, IEEE, Yury Polyanskiy, Senior Member, IEEE, Sergio Verd´u, Fellow, IEEE, Abstract—This paper studies the fundamental limits of the

                    Add to Reading List

                    Source URL: vkostina.caltech.edu

                    Language: English - Date: 2015-09-06 16:54:17