The following pages link to Information and Computation (Q6030974):

Displaying 50 items.

• A Short Biography of Arto Salomaa (Q29012638) (← links)
• Toward a theory of Pollard's rho method (Q29031634) (← links)
• Parallel recognition of series-parallel graphs (Q29036715) (← links)
• The Vertex Separation and Search Number of a Graph (Q29039022) (← links)
• The complexity of stochastic games (Q29040293) (← links)
• Rigid E-unification: NP-completeness and applications to equational matings (Q29392267) (← links)
• Nominal logic, a first order theory of names and binding (Q29393340) (← links)
• The Weighted Majority Algorithm (Q29400139) (← links)
• In Memoriam: Paris C. Kanellakis (1953–1995) (Q30040568) (← links)
• Boolean grammars (Q30053738) (← links)
• Existence of constants in regular splicing languages (Q41542044) (← links)
• Region-Based Memory Management (Q55222538) (← links)
• Type inference for polymorphic references (Q55222540) (← links)
• Inapproximability of the Tutte polynomial (Q55879601) (← links)
• Resolution for Quantified Boolean Formulas (Q55889272) (← links)
• Graph Isomorphism is in SPP (Q55889735) (← links)
• Notions of computation and monads (Q55895577) (← links)
• A Syntactic Approach to Type Soundness (Q55952333) (← links)
• Reasoning about Infinite Computations (Q55952477) (← links)
• A calculus of mobile processes, I (Q56019902) (← links)
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q56038299) (← links)
• On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q56039186) (← links)
• The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n (Q56049342) (← links)
• An Optimal Algorithm for Selection in a Min-Heap (Q56049346) (← links)
• Algorithms for determining relative star height and star height (Q56061218) (← links)
• Kripke Logical Relations and PCF (Q56092885) (← links)
• Denotational semantics of a parallel object-oriented language (Q56092891) (← links)
• A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (Q56140181) (← links)
• A Calculus for Overloaded Functions with Subtyping (Q56145254) (← links)
• The complexity of approximating bounded-degree Boolean #CSP (Q56323824) (← links)
• Counting and sampling H-colourings (Q56323928) (← links)
• Exact algorithms for maximum independent set (Q56335614) (← links)
• The calculus of constructions (Q56385237) (← links)
• Approximate counting, uniform generation and rapidly mixing Markov chains (Q56386806) (← links)
• Some results on the generalized star-height problem (Q56388123) (← links)
• Descriptional and computational complexity of finite automata—A survey (Q56431188) (← links)
• Point Location in Arrangements of Hyperplanes (Q56442932) (← links)
• Full Abstraction for PCF (Q56443857) (← links)
• Full Abstraction in the Lazy Lambda Calculus (Q56443859) (← links)
• Structure of parallel multipliers for a class of fields GF(2m) (Q56453869) (← links)
• Easy multiplications I. The realm of Kleene's theorem (Q56481486) (← links)
• Hardness of fully dense problems (Q56486199) (← links)
• An Extension of System F with Subtyping (Q56518661) (← links)
• Learning regular sets from queries and counterexamples (Q56620637) (← links)
• A trade-off between page number and page width of book embeddings of graphs (Q56689182) (← links)
• Synchronization (Q56767142) (← links)
• Sequential operators in computability logic (Q56767143) (← links)
• Algorithmic Analysis of Programs with Well Quasi-ordered Domains (Q56901005) (← links)
• Aeolus: A component model for the cloud (Q56901755) (← links)
• On the complexity of some colorful problems parameterized by treewidth (Q56926595) (← links)