Joel H. Spencer, et al.  Home/Search
Context
Related
| nyu.edu/cs/faculty/spencer/p...stacs.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/cs/faculty/spenc...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: appeared in STACS `98) Joel H. Spencer 1 and Katherine St. John 2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara University, Santa Clara, CA 95053-0290 1 Abstract We give a complete characterization for the limit probabilities of first order sentences over sparse random bit strings at the threshold of adjacency. For strings of length n, we let the probability that a bit is "on" be c p n , for a real positive number c. For every... (Update)
Similar documents (at the sentence level):
15.2%: Random Unary Predicates: Almost Sure Theories and Countable.. - Spencer, John (1997) (Correct)
14.0%: Limit Probabilities for Random Sparse Bit Strings - John (1997) (Correct)
Active bibliography (related documents): More All
0.6: The Tenacity of Zero-One Laws - Spencer, John (Correct)
0.2: On the Limit Values of Probabilities for the First Order.. - Spencer, Thoma (1997) (Correct)
0.2: Logic and Random Structures - Spencer (Correct)
Similar documents based on text: More All
0.2: Ups and Downs of First Order Sentences on Random Graphs - Spencer, Tardos (Correct)
0.1: Clara: An Actor Language for High Performance Distributed Computing - Carolyn (Correct)
0.1: Biological Status Of Fish And Invertebrate Assemblages In A.. - Cordell, Higgins (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ spencer98random,
author = "Joel Spencer and Katherine St. John",
title = "Random Sparse Bit Strings at the Threshold of Adjacency",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "94-104",
year = "1998",
url = "citeseer.ist.psu.edu/spencer98random.html" }
Citations (may not include all citations):259 Elements of the theory of computation (context) - Lewis, Papadimitriou - 1981
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
39 Expressibility as a complexity measure: results and directio.. (context) - Immerman - 1987
15 and Paul Erdos (context) - Alon, Spencer - 1992
11 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
7 Subclasses of Presburger arithmetic and the polynomial-time .. (context) - Graedel - 1988
6 On sets of relations definable by addition (context) - Lynch - 1982
5 A zero-one law for a random subset (context) - Dolan - 1991
5 Random unary predicates: Almost sure theories and countable .. - Spencer, St - 1997
5 Random Structures and Algorithms (context) - Shelah, Spencer et al. - 1994
5 Probabilities of sentences about very sparse random graphs (context) - Lynch - 1992
3 the limit values of probabilities for the first order proper.. - Spencer, Thoma - 1997
3 Can you feel the double jump (context) - Shelah, Spencer - 1994
1 Limit probabilities for random sparse bit strings - St - 1997
Documents on the same site (http://cs.nyu.edu/cs/faculty/spencer/papers/papers.html): More
Asymptotic Packing via A Branching Process - Spencer (1995) (Correct)
Nearly Perfect Matchings in Regular Simple Hypergraphs - Alon, Kim, Spencer (Correct)
Discrepancy in Arithmetic Progressions - Matousek, Spencer (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC