181![arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨ arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨](https://www.pdfsearch.io/img/0f9408010da80cd30eb86fd1962c61b3.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2013-05-03 12:26:04
|
---|
182![Noname Vol. 43 Monotonicity Inference for Higher-Order Formulas Jasmin Christian Blanchette · Alexander Krauss Noname Vol. 43 Monotonicity Inference for Higher-Order Formulas Jasmin Christian Blanchette · Alexander Krauss](https://www.pdfsearch.io/img/bf08515f0eeb3884b6c84616a72f13b9.jpg) | Add to Reading ListSource URL: www21.in.tum.deLanguage: English - Date: 2015-01-25 16:18:54
|
---|
183![Monotonicity Inference for Higher-Order Formulas Jasmin Christian Blanchette? and Alexander Krauss Institut für Informatik, Technische Universität München, Germany {blanchette,krauss}@in.tum.de Monotonicity Inference for Higher-Order Formulas Jasmin Christian Blanchette? and Alexander Krauss Institut für Informatik, Technische Universität München, Germany {blanchette,krauss}@in.tum.de](https://www.pdfsearch.io/img/908b915d22b9484d02d1cb9ccb18eb50.jpg) | Add to Reading ListSource URL: www21.in.tum.deLanguage: English - Date: 2010-04-01 08:28:46
|
---|
184![SUBDIVISION RULES AND VIRTUAL ENDOMORPHISMS J. W. CANNON, W. J. FLOYD, W. R. PARRY, AND K. M. PILGRIM Abstract. Suppose f : S 2 → S 2 is a postcritically finite branched covering without periodic branch points. If f is SUBDIVISION RULES AND VIRTUAL ENDOMORPHISMS J. W. CANNON, W. J. FLOYD, W. R. PARRY, AND K. M. PILGRIM Abstract. Suppose f : S 2 → S 2 is a postcritically finite branched covering without periodic branch points. If f is](https://www.pdfsearch.io/img/8813342670dcbd3321acf56c563d9ad0.jpg) | Add to Reading ListSource URL: www.math.vt.eduLanguage: English - Date: 2009-06-09 14:36:42
|
---|
185![CONSTRUCTING RATIONAL MAPS FROM SUBDIVISION RULES J. W. CANNON, W. J. FLOYD, R. KENYON, AND W. R. PARRY Abstract. Suppose R is an orientation-preserving finite subdivision rule with an edge pairing. Then the subdivision CONSTRUCTING RATIONAL MAPS FROM SUBDIVISION RULES J. W. CANNON, W. J. FLOYD, R. KENYON, AND W. R. PARRY Abstract. Suppose R is an orientation-preserving finite subdivision rule with an edge pairing. Then the subdivision](https://www.pdfsearch.io/img/67f02267b031f8b3eae23178b85c4b70.jpg) | Add to Reading ListSource URL: www.math.vt.eduLanguage: English - Date: 2003-03-28 11:37:09
|
---|
186![A Very Modal Model of a Modern, Major, General Type System Andrew W. Appel ∗ Paul-Andr´e Melli`es A Very Modal Model of a Modern, Major, General Type System Andrew W. Appel ∗ Paul-Andr´e Melli`es](https://www.pdfsearch.io/img/ea897c2c6a41e411d272eacf11364813.jpg) | Add to Reading ListSource URL: www.cs.princeton.eduLanguage: English - Date: 2006-10-27 11:28:34
|
---|
187![COMBINATORIALLY REGULAR POLYOMINO TILINGS J. W. CANNON, W. J. FLOYD, AND W. R. PARRY Abstract. Let T be a regular tiling of R2 which has the origin 0 as a vertex, and suppose that ϕ : R2 → R2 is a homeomorphism such t COMBINATORIALLY REGULAR POLYOMINO TILINGS J. W. CANNON, W. J. FLOYD, AND W. R. PARRY Abstract. Let T be a regular tiling of R2 which has the origin 0 as a vertex, and suppose that ϕ : R2 → R2 is a homeomorphism such t](https://www.pdfsearch.io/img/0e6a35ccae2cc9215e4f010feb44e599.jpg) | Add to Reading ListSource URL: www.math.vt.eduLanguage: English - Date: 2003-09-11 22:04:56
|
---|
188![Operational domain theory and topology of sequential programming languages Mart´ın Escard´o Weng Kin Ho Operational domain theory and topology of sequential programming languages Mart´ın Escard´o Weng Kin Ho](https://www.pdfsearch.io/img/c4ed75a8cea896001f0b95bb85b0da1d.jpg) | Add to Reading ListSource URL: www.cs.bham.ac.ukLanguage: English - Date: 2008-12-11 05:21:07
|
---|
189![EXPANSION COMPLEXES FOR FINITE SUBDIVISION RULES I J. W. CANNON, W. J. FLOYD, AND W. R. PARRY Abstract. This paper develops the basic theory of conformal structures on finite subdivision rules. The work depends heavily EXPANSION COMPLEXES FOR FINITE SUBDIVISION RULES I J. W. CANNON, W. J. FLOYD, AND W. R. PARRY Abstract. This paper develops the basic theory of conformal structures on finite subdivision rules. The work depends heavily](https://www.pdfsearch.io/img/a77f8efc008264ff0f12189367a8f177.jpg) | Add to Reading ListSource URL: www.math.vt.eduLanguage: English - Date: 2003-09-11 21:58:25
|
---|
190![1 Abstract A countable group Γ is called shift-minimal if every non-trivial measure preserving action of Γ weakly contained in the Bernoulli shift Γ y ([0, 1]Γ , λΓ ) is free. We show that any group Γ whose reduc 1 Abstract A countable group Γ is called shift-minimal if every non-trivial measure preserving action of Γ weakly contained in the Bernoulli shift Γ y ([0, 1]Γ , λΓ ) is free. We show that any group Γ whose reduc](https://www.pdfsearch.io/img/3c32cb68df1f4b392f08bdb1c86e39b6.jpg) | Add to Reading ListSource URL: www.math.rutgers.eduLanguage: English - Date: 2012-12-21 17:27:31
|
---|