default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 23
Volume 23, June 1984
- Cristian Calude, Ion Chitescu:
A class of nuniversal P Marti-Löf tests. Bull. EATCS 23: 15-21 (1984) - Robert P. Daley, Carl H. Smith:
On the complextiy of inductive inference. Bull. EATCS 23: 22-27 (1984) - Alain Finkel:
Petri Nets and monogenous FIFO nets. Bull. EATCS 23: 28-30 (1984) - Rusins Freivalds:
An answer to an open problem. Bull. EATCS 23: 31-32 (1984) - Juraj Hromkovic:
On the power of Yao-Rivest technique. Bull. EATCS 23: 33-34 (1984) - Ivan Korec:
Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages. Bull. EATCS 23: 35-41 (1984) - Kurt Lautenbach, Anastasia Pagnoni:
On the various high-level Petri Nets and their invariatnts. Bull. EATCS 23: 42-58 (1984) - Arjen K. Lenstra:
Polynomial - time algorithms for the factorization of polynomials. Bull. EATCS 23: 59-75 (1984)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
