Deprecated : The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Information and Computation -- 1994
Information and Computation -- 1994
Sauro Tulipani . Decidability of
the existential theory of infinite terms with subterm relation.
Information and Computation , 108(1):1-33, January 1994.
Abstract
and References.
[BibTeX entry ]
Hans L. Bodlaender , Shlomo Moran , and Manfred K. Warmuth . The
distributed bit complexity of the ring: From the anonymous to the
non-anonymous case. Information and Computation ,
108(1):34-50, January 1994.
Abstract
and References.
[BibTeX entry ]
Gérard Boudol .
Lambda-calculi for (strict) parallel functions. Information and
Computation , 108(1):51-127, January 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Frank S. de Boer and Catuscia Palamidessi .
Embedding as a tool for language comparison. Information and
Computation , 108(1):128-157, January 1994.
Abstract
and References.
[BibTeX entry ]
Rafail E. Krichevsky .
Occam's razor, partially specified Boolean functions, string matching,
and independent sets. Information and Computation ,
108(1):158-174, January 1994.
References.
[BibTeX entry ]
Volume 108, Number 2, February 1, 1994
Takeshi Shinohara . Rich
classes inferable from positive data: Length-bounded elementary formal
systems. Information and Computation , 108(2):175-186, 1
February 1994.
References
and Citations.
[BibTeX entry ]
Ricardo A. Baeza-Yates and
Gaston H.
Gonnet . Fast string matching with mismatches. Information and
Computation , 108(2):187-199, 1 February 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Johan Håstad , Ingo Wegener , Norbert Wurm , and Sang-Zin Yi . Optimal depth, very
small size circuits for symmetric functions in AC ^0.
Information and Computation , 108(2):200-211, 1 February
1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Nick Littlestone and Manfred K. Warmuth .
The weighted majority algorithm. Information and
Computation , 108(2):212-261, 1 February 1994.
References
and Citations.
[BibTeX entry ]
Danilo Bruschi , Giovanni Pighizzini , and
Nicoletta
Sabadini . On the existence of minimum asynchronous automata and on
the equivalence problem for unambiguous regular trace languages.
Information and Computation , 108(2):262-285, 1 February
1994.
Citations.
[BibTeX entry ]
Special Issue: Selections from International Conference on
Theoretical Aspects of Computer Software (TACS'91)
Mariangiola
Dezani-Ciancaglini . Preface. Information and
Computation , 109(1/2):1-3, 15 February/March 1994.
[BibTeX entry ]
Luca Cardelli , Simone Martini , John C. Mitchell , and Andre Scedrov . An extension of
system F with subtyping. Information and
Computation , 109(1/2):4-56, 15 February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Pierre-Louis Curien and Giorgio Ghelli .
Decidability and confluence of beta eta top_\le reduction in
F _\le. Information and Computation ,
109(1/2):57-114, 15 February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Paola Giannini and Simona Ronchi Della
Rocca . A type inference algorithm for a stratified polymorphic type
discipline. Information and Computation , 109(1/2):115-173,
15 February/March 1994.
References,
Citations,
etc.
[BibTeX entry ]
Susumu Hayashi . Singleton,
union and intersection types for program extraction. Information
and Computation , 109(1/2):174-210, 15 February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Wesley
Phoa . From term models to domains. Information and
Computation , 109(1/2):211-255, 15 February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Gordon Plotkin . A semantics
for static type inference. Information and Computation ,
109(1/2):256-299, 15 February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Martín Abadi . A
semantics for static type inference in a nondeterministic language.
Information and Computation , 109(1/2):300-306, 15
February/March 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Jonathan Sorenson . Polylog
depth circuits for integer factoring and discrete logarithms.
Information and Computation , 110(1):1-18, April 1994.
Abstract
and References.
[BibTeX entry ]
P.
Thanisch , G.
Loizou , and J.
Nummenmaa . Finding compact scheme forests in nested normal form is
NP-hard. Information and Computation , 110(1):19-41, April
1994.
References.
[BibTeX entry ]
Raymond
Ng and V. S.
Subrahmanian . Stable semantics for probabilistic deductive
databases. Information and Computation , 110(1):42-83, April
1994.
References
and Citations.
[BibTeX entry ]
Ludek Kucera , Alberto
Marchetti-Spaccamela , and Marco Protasi . On learning
monotone DNF formulae under uniform distributions. Information and
Computation , 110(1):84-95, April 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Jerry L. Trahan , Vijaya Ramachandran , and
Michael C. Loui .
Parallel random access machines with both multiplication and shifts.
Information and Computation , 110(1):96-118, April 1994.
Abstract
and References.
[BibTeX entry ]
Steven Homer and Jie Wang . Immunity of complete
problems. Information and Computation , 110(1):119-129,
April 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Marc J. van Kreveld and Mark H. Overmars .
Concatenable structures for decomposable problems. Information and
Computation , 110(1):130-148, April 1994.
Abstract
and References.
[BibTeX entry ]
Bernhard Steffen and Anna
Ingólfsdóttir . Characteristic formulae for processes
with divergence. Information and Computation ,
110(1):149-163, April 1994.
Abstract
and References.
[BibTeX entry ]
Volker Diekert , Edward Ochma\'nski , and Klaus Reinhardt . On
confluent semi-commutations: Decidability and complexity results.
Information and Computation , 110(1):164-182, April 1994.
Abstract
and References.
[BibTeX entry ]
Hagit Attiya and Nancy A. Lynch . Time bounds for
real-time process control in the presence of timing uncertainty.
Information and Computation , 110(1):183-232, April 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Guo-Qiang Zhang . A
representation of SFP . Information and
Computation , 110(1):233-263, April 1994.
Abstract
and References.
[BibTeX entry ]
Volume 110, Number 2, May 1, 1994
Special Issue: Selections from 1991 IEEE Symposium on Logic in
Computer Science
Gilles
Kahn . Preface. Information and Computation , 110(2):iii,
1 May 1994.
[BibTeX entry ]
Antonio Bucciarelli and Thomas Ehrhard .
Sequentiality in an extensional framework. Information and
Computation , 110(2):265-296, 1 May 1994.
Abstract,
Citations,
etc.
[BibTeX entry ]
Thierry Coquand . An analysis
of Ramsey's theorem. Information and Computation ,
110(2):297-304, 1 May 1994.
Abstract
and References.
[BibTeX entry ]
Patrice Godefroid and Pierre Wolper . A partial
approach to model checking. Information and Computation ,
110(2):305-326, 1 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Joshua S. Hodas and Dale Miller . Logic programming in
a fragment of intuitionistic linear logic. Information and
Computation , 110(2):327-365, 1 May 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Dexter C. Kozen . A completeness
theorem for Kleene algebras and the algebra of regular events.
Information and Computation , 110(2):366-390, 1 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Daniel Leivant . A foundational
delineation of poly-time. Information and Computation ,
110(2):391-420, 1 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Special Issue: Selections from 1992 IEEE Symposium on Logic in
Computer Science (Part 1)
Andre Scedrov . Preface.
Information and Computation , 111(1):iii, 15 May 1994.
[BibTeX entry ]
Luca
Aceto , Bard Bloom ,
and Frits
Vaandrager . Turning SOS rules into equations. Information and
Computation , 111(1):1-52, 15 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Samson Abramsky and Radha Jagadeesan . New
foundations for the geometry of interaction. Information and
Computation , 111(1):53-119, 15 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Davide Sangiorgi . The lazy
lambda calculus in a concurrency scenario. Information and
Computation , 111(1):120-153, 15 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Hubert Comon , Marianne Haberstrau , and
Jean-Pierre
Jouannaud . Syntacticness, cycle-syntacticness, and shallow theories.
Information and Computation , 111(1):154-191, 15 May 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Volume 111, Number 2, June 1994
Special Issue: Selections from 1992 IEEE Symposium on Logic in
Computer Science (Part 2)
Thomas A. Henzinger , Xavier Nicollin , Joseph Sifakis , and Sergio Yovine . Symbolic model
checking for real-time systems. Information and
Computation , 111(2):193-244, June 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Jean-Pierre Talpin and Pierre Jouvelot . The
type and effect discipline. Information and Computation ,
111(2):245-296, June 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Robert Cartwright , Pierre-Louis Curien , and Matthias Felleisen .
Fully abstract semantics for observably sequential languages.
Information and Computation , 111(2):297-401, June 1994.
Abstract,
References,
Citations,
etc.
[BibTeX entry ]
Martín Abadi and Joseph Y. Halpern .
Decidability and expressiveness for first-order logics of probability.
Information and Computation , 112(1):1-36, July 1994.
Abstract
and References.
[BibTeX entry ]
Christos Levcopoulos and
Ola Petersson . Sorting
shuffled monotone sequences. Information and Computation ,
112(1):37-50, July 1994.
Abstract
and References.
[BibTeX entry ]
Vince Grolmusz . The BNS lower
bound for multi-party protocols in nearly optimal. Information and
Computation , 112(1):51-54, July 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Matthew Hennessy . A fully
abstract denotational model for higher-order processes.
Information and Computation , 112(1):55-95, July 1994.
References
and Citations.
[BibTeX entry ]
Ian Parberry . A guide for new
referees in theoretical computer science. Information and
Computation , 112(1):96-116, July 1994.
Abstract,
References,
etc.
[BibTeX entry ]
This guide is available
online .
Volume 112, Number 2, August 1, 1994
Hubert Comon and Catherine Delor . Equational
formulae with membership constraints. Information and
Computation , 112(2):167-216, 1 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Eric Allender and Ulrich Hertrampf . Depth
reduction for circuits of unbounded fan-in. Information and
Computation , 112(2):217-238, 1 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Yannis Dimopoulos and Vangelis Magirou . A
graph-theoretic approach to default logic. Information and
Computation , 112(2):239-256, 1 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Ramamohan Paturi and Michael E. Saks . Approximating
threshold circuits by rational functions. Information and
Computation , 112(2):257-272, 1 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Thomas A. Henzinger , Zohar Manna , and Amir Pnueli . Temporal proof
methodologies for timed transition systems. Information and
Computation , 112(2):273-337, 1 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
M.
Beaudry . Membership testing in threshold one transformation monoids.
Information and Computation , 113(1):1-25, 15 August 1994.
References
and Citations.
[BibTeX entry ]
Egon
Wanke . On the decidability of certain integer subgraph problems on
context-free graph languages. Information and Computation ,
113(1):26-49, 15 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
J.
A. Ellis , I. H.
Sudborough , and J.
S. Turner . The vertex separation and search number of a graph.
Information and Computation , 113(1):50-79, 15 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Baruch Schieber and Marc Snir . Calling names on nameless
networks. Information and Computation , 113(1):80-101, 15
August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Richard Gerber and Insup Lee . A resource-based
prioritized bisimulation for real-time systems. Information and
Computation , 113(1):102-142, 15 August 1994.
References
and Citations.
[BibTeX entry ]
Evelyne Contejean and Hervé Devie . An
efficient incremental algorithm for solving systems of linear
Diophantine equations. Information and Computation ,
113(1):143-172, 15 August 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Volume 113, Number 2, September 1994
Gadi Taubenfeld , Shmuel Katz , and Shlomo Moran . Impossibility
results in the presence of multiple faulty processes. Information
and Computation , 113(2):173-198, September 1994.
References.
[BibTeX entry ]
Andrew Chin and W. F. McColl . Virtual shared
memory: Algorithms and complexity. Information and
Computation , 113(2):199-219, September 1994.
Abstract
and References.
[BibTeX entry ]
Andrew T. Ogielski . Minimal
samples of positive examples identifying k -CNF Boolean
functions. Information and Computation , 113(2):220-229,
September 1994.
References.
[BibTeX entry ]
Philip M. Long and Manfred K. Warmuth . Composite
geometric concepts and polynomial predictability. Information and
Computation , 113(2):230-252, September 1994.
References
and Citations.
[BibTeX entry ]
Mitchell Wand and Zheng-Yu Wang . Conditional
lambda-theories and the verification of static properties of programs.
Information and Computation , 113(2):253-277, September
1994.
Abstract
and References.
[BibTeX entry ]
David Harel and Danny Raz . Deciding emptiness for
stack automata on infinite trees. Information and
Computation , 113(2):278-299, September 1994.
Abstract
and References.
[BibTeX entry ]
Mark
Jerrum . Simple translation-invariant concepts are hard to learn.
Information and Computation , 113(2):300-311, September
1994.
References.
[BibTeX entry ]
Yehuda Afek and Yossi Matias . Elections in
anonymous networks. Information and Computation ,
113(2):312-330, September 1994.
References
and Citations.
[BibTeX entry ]
Jeffrey Shallit . Numeration
systems, linear recurrences, and regular sets. Information and
Computation , 113(2):331-347, September 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Val Breazu-Tannen and Jean Gallier . Polymorphic
rewriting conserves algebraic confluence. Information and
Computation , 114(1):1-29, October 1994.
References
and Citations.
[BibTeX entry ]
Corrado Böhm and Benedetto Intrigila . The
ant-lion paradigm for strong normalization. Information and
Computation , 114(1):30-49, October 1994.
[BibTeX entry ]
Javier Esparza . Reduction and
synthesis of live and bounded free choice Petri nets. Information
and Computation , 114(1):50-87, October 1994.
[BibTeX entry ]
Ronald L. Rivest and Robert Sloan . A formal model of
hierarchical concept learning. Information and Computation ,
114(1):88-114, October 1994.
References.
[BibTeX entry ]
Jonathan Sorenson and Ian Parberry . Two fast
parallel prime number sieves. Information and Computation ,
114(1):115-130, October 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Xavier Nicollin and Joseph Sifakis . The algebra of
timed processes ATP: Theory and application. Information and
Computation , 114(1):131-178, October 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Volume 114, Number 2, November 1, 1994
Mark
Fulk and Sanjay
Jain . Approximate inference and scientific method. Information
and Computation , 114(2):179-191, 1 November 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Yael Shemesh and Nissim Francez . Finite-state
unification automata and relational languages. Information and
Computation , 114(2):192-213, 1 November 1994.
References.
[BibTeX entry ]
Evangelos Kranakis , Danny Krizanc , and Jacob van den Berg . Computing
Boolean functions on anonymous networks. Information and
Computation , 114(2):214-236, 1 November 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Kosaburo Hashiguchi . The
infinite 2-star height hierarchy of extended regular languages of star
degree at most two. Information and Computation ,
114(2):237-246, 1 November 1994.
References.
[BibTeX entry ]
Gérard Boudol and Ilaria Castellani .
Flow models of distributed computations: Three equivalent semantics for
CCS. Information and Computation , 114(2):247-314, 1
November 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
A. Ehrenfeucht , H. J. Hoogeboom , and G. Rozenberg .
Combinatorial properties of dependence graphs. Information and
Computation , 114(2):315-328, 1 November 1994.
[BibTeX entry ]
William Cook and Jens Palsberg . A denotational
semantics of inheritance and its correctness. Information and
Computation , 114(2):329-350, 1 November 1994.
Abstract
and Citations.
[BibTeX entry ]
Moshe
Y. Vardi and Pierre
Wolper . Reasoning about infinite computations. Information and
Computation , 115(1):1-37, 15 November 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Andrew K. Wright and Matthias Felleisen . A
syntactic approach to type soundness. Information and
Computation , 115(1):38-94, 15 November 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Alan
D. Fekete . Asynchronous approximate agreement. Information and
Computation , 115(1):95-124, 15 November 1994.
References.
[BibTeX entry ]
Eiichi Horita , J. W. de Bakker , and J. J. M. M. Rutten . Fully
abstract denotational models for nonuniform concurrent languages.
Information and Computation , 115(1):125-178, 15 November
1994.
References
and Citations.
[BibTeX entry ]
Volume 115, Number 2, December 1994
L.
Aceto and M.
Hennessy . Adding action refinement to a finite process algebra.
Information and Computation , 115(2):179-247, December 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
D. Haussler , N. Littlestone , and M. K. Warmuth .
Predicting {0,1}-functions on randomly drawn points. Information
and Computation , 115(2):248-292, December 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Alain J. Mayer and Larry J. Stockmeyer . Word
problems -- this time with interleaving. Information and
Computation , 115(2):293-311, December 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Eli
Upfal . Tolerating a linear number of faults in networks of bounded
degree. Information and Computation , 115(2):312-320,
December 1994.
Abstract
and References.
[BibTeX entry ]
Phokion G. Kolaitis and Madhukar N. Thakur .
Logical definability of NP optimization problems. Information and
Computation , 115(2):321-353, December 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Jan Friso Groote and Hans Hüttel . Undecidable
equivalences for basic process algebra. Information and
Computation , 115(2):354-371, December 1994.
Abstract,
References,
and Citations.
[BibTeX entry ]
Shortcuts:
Information and Computation homepage
Bibliography top level
Information and Computation Author Index
Search the HBP database