Titlebook: Automata, Languages and Programming; 22nd International C Zoltán Fül?p,Ferenc Gécseg Conference proceedings 1995 Springer-Verlag Berlin Hei

sesamoiditis

書目名稱Automata, Languages and Programming影響因子(影響力)




書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名




書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度




書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Automata, Languages and Programming被引頻次




書目名稱Automata, Languages and Programming被引頻次學(xué)科排名




書目名稱Automata, Languages and Programming年度引用




書目名稱Automata, Languages and Programming年度引用學(xué)科排名




書目名稱Automata, Languages and Programming讀者反饋




書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名

antiquated

https://doi.org/10.1007/978-3-531-91958-4arate devices and distinguishing between the space used for processing information and the space used merely to read the input word from. Likewise, we distinguish between the time used for processing information and the time used merely to read the input word.

只有

DRAFT

Fast gossiping by short messages,ymptotically matching upper and lower bounds. We also study the case of arbitrary . and we exactly determine the optimal number of communication rounds to perform gossiping under this hypothesis for complete graphs, hypercubes, rings, and paths.

俗艷

BUST

The complexity of searching succinctly represented graphs,sion procedures. It is based on previously studied concepts of “succinct representation” techniques, and allows us to prove PSPACE-completeness or EXPTIME-completeness of specific, natural problems on implicit graphs, such as those solved by A., AO.; and other best-first search strategies.

類型

ARCHE

Conference proceedings 1995sions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.

Nibble

https://doi.org/10.1007/978-3-663-10171-0thematical results proving thereby the soundness of our approach. Our theory is a proper generalization of the theory of finite and infinite words (with explicit termination) and of the theory of finite and infinite (real and complex) traces. We make use of trace theory, domain theory, and topology.

falsehood