×

Mathematical foundations of computer science 1994. 19th international symposium, MFCS ’94, Košice, Slovakia, August 22–26, 1994. Proceedings. (English) Zbl 0825.68120

Lecture Notes in Computer Science 841. Berlin: Springer-Verlag. x, 628 p. DM 114.00; öS 889.20; sFr 114.00 /sc (1994).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 0825.00085].
Indexed articles:
Cheatham, Thomas, Models, languages, and compiler technology for high performance computers, 1-26 [Zbl 1493.68096]
Cosnard, Michel; Matamala, Martin, On NC-real complexity classes for additive circuits and their relations with NC, 27-37 [Zbl 1494.68088]
Ďuriš, Pavol; Rolim, José D. P., E-complete sets do not have optimal polynomial time approximations, 38-51 [Zbl 1494.68090]
Bloom, Stephen L.; Ésik, Zoltán, Solving polynomial fixed point equations, 52-67 [Zbl 1496.08005]
Makowsky, J. A., Capturing complexity classes with Lindström quantifiers, 68-71 [Zbl 1496.03166]
Monien, Burkhard; Diekmann, Ralf; Lüling, Reinhard, Communication throughput of interconnection networks, 72-86 [Zbl 1493.68029]
Lipton, James; O’Donnell, Michael J., Intuitive counterexamples for constructive fallacies, 87-111 [Zbl 1496.03250]
Orejas, Fernando; Pino, Elvira; Ehrig, Hartmut, Algebraic methods in the compositional analysis of logic programs, 112-126 [Zbl 1493.68072]
Paterson, Mike; Dančík, Vlado, Longest common subsequences, 127-142 [Zbl 1493.68284]
Sgall, Jiří, On-line scheduling of parallel jobs, 159-176 [Zbl 1493.68038]
Winskel, Glynn, Stable bistructure models of PCF (preliminary draft), 177-197 [Zbl 1493.68064]
Albers, Susanne, A competitive analysis of the list update problem with lookahead, 199-210 [Zbl 1493.68399]
Alessi, F.; Dezani-Ciancaglini, M.; de’Liguoro, U., May and must convergency in concurrent \(\lambda \)-calculus (extended abstract), 211-220 [Zbl 1493.68079]
Ambos-Spies, Klaus; Neis, Hans-Christian; Terwijn, Sebastiaan A., Genericity and measure for exponential time (extended abstract), 221-232 [Zbl 1493.68147]
Baeza-Yates, Ricardo A., Analysis of bounded disorder, 233-244 [Zbl 1493.68127]
Bertoni, Alberto; Mereghetti, Carlo; Pighizzini, Giovanni, On languages accepted with simultaneous complexity bounds and their ranking problem, 245-255 [Zbl 1493.68137]
De Boer, F. S.; van Hulst, M., A proof system for asynchronously communicating deterministic processes, 256-265 [Zbl 1493.68243]
Bouabdallah, A.; Heydemann, M. C.; Opatrny, J.; Sotteau, D., Embedding complete binary trees into star networks, 266-275 [Zbl 1493.68026]
Damm, Carsten; Holzer, Markus, Inductive counting below LOGSPACE, 276-285 [Zbl 1494.68089]
Dassow, Jürgen, Decision problems for edge grammars, 286-295 [Zbl 1493.68172]
Dehne, Frank; Klein, Rolf, “The big sweep”: on the power of the wavefront approach to Voronoi diagrams, 296-305 [Zbl 1493.68369]
Denejko, Piotr; Diks, Krzysztof; Pelc, Andrzej; Piotrów, Marek, Reliable minimum finding comparator networks, 306-315 [Zbl 1494.68017]
Dessmark, Anders; Lingas, Andrzej; Garrido, Oscar, On parallel complexity of maximum \(f\)-matching and the degree sequence problem, 316-325 [Zbl 1493.68264]
Dietzfelbinger, Martin; Hromkovič, Juraj; Schnitger, Georg, A comparison of two lower bound methods for communication complexity (extended abstract), 326-335 [Zbl 1494.68086]
Obono, S. Eyono; Goralcik, P.; Maksimenko, M., Efficient solving of the word equations in one variable, 336-341 [Zbl 1494.68098]
Ferrari, Gianluigi; Montanari, Ugo; Quaglia, Paola, A \(\pi \)-calculus with explicit substitutions: the late semantics, 342-351 [Zbl 1493.68244]
Forti, Marco; Honsell, Furio; Lenisa, Marina, Processes and hyperuniverses, 352-363 [Zbl 1493.68245]
Frayman, Felix; Kanevsky, Valery; Kirchherr, Walter, The combinatorial complexity of a finite string, 364-372 [Zbl 1493.68165]
Gold, Robert, A fully abstract semantics for termination in Petri nets, 373-382 [Zbl 1493.68247]
Halfeld Ferrari Alves, M.; Laurent, D.; Spyratos, N., Passive and active rules in deductive databases, 383-392 [Zbl 1493.68131]
Hegedűs, Tibor, Combinatorial results on the complexity of teaching and learning, 393-402 [Zbl 1493.68168]
Hermo, Montserrat, Degrees and reducibilities of easy tally sets, 403-412 [Zbl 1493.68150]
Hoogeboom, Hendrik Jan; ten Pas, Paulien, MSO definable text languages, 413-422 [Zbl 1493.68189]
Hromkovič, Juraj; Kari, Jarkko; Kari, Lila; Pardubská, Dana, Two lower bounds on distributive generation of languages, 423-432 [Zbl 1493.68146]
Inverardi, Paola; Venturini Zilli, Marisa, Rational rewriting (extended abstract), 433-442 [Zbl 1493.68174]
Karhumäki, Juhani; Plandowski, Wojciech, On the size of independent systems of equations in semigroups, 443-452 [Zbl 1496.20087]
Karpinski, Marek; Rytter, Wojciech, On a sublinear time parallel construction of optimal binary search trees, 453-461 [Zbl 1494.68071]
Kavvadias, Dimitris; Pantziou, Grammati E.; Spirakis, Paul G.; Zaroliagis, Christos D., Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems, 462-472 [Zbl 1493.68272]
Klasing, Ralf, The relationship between gossiping in vertex-disjoint paths mode and bisection width (extended abstract), 473-483 [Zbl 1494.68019]
Kůrka, Petr, A comparison of finite and cellular automata, 484-493 [Zbl 1493.68190]
Lange, Klaus-Jörn; Reinhardt, Klaus, Empty alternation, 494-503 [Zbl 1493.68151]
Le Saëc, Bertrand; Litovsky, Igor, On the minimization problem for \(\omega \)-automata, 504-514 [Zbl 1493.68193]
Meinel, Christoph; Slobodová, Anna, On the complexity of constructing optimal ordered binary decision diagrams, 515-524 [Zbl 1493.68161]
Narayanan, H.; Roy, Subir; Patkar, Sachin, Approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach, 525-535 [Zbl 1493.68278]
De Nicola, Rocco; Labella, Anna, A completeness theorem for nondeterministic Kleene algebras, 536-545 [Zbl 1493.68196]
Papatriantafilou, Marina; Tsigas, Philippas, How a rainbow coloring function can simulate wait-free handshaking, 546-555 [Zbl 1493.68034]
Plump, Detlef, Critical pairs in term graph rewriting, 556-566 [Zbl 1493.68177]
Priami, Corrado; Yankelevich, Daniel, Read-write causality, 567-576 [Zbl 1493.68254]
Richomme, Gwénaël, Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract), 577-586 [Zbl 1496.20089]
Salomaa, Kai; Wood, Derick; Yu, Sheng, Complexity of E0L structural equivalence, 587-596 [Zbl 1493.68162]
Sibeyn, Jop F.; Chlebus, Bogdan S.; Kaufmann, Michael, Shorter queues for permutation routing on meshes, 597-607 [Zbl 1493.68039]
Sieber, Kurt, Full abstraction for the second order subset of an Algol-like language, 608-617 [Zbl 1493.68062]
Weber, Andreas; Head, Tom, The finest homophonic partition and related code concepts, 618-628 [Zbl 1493.68412]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 0825.00085
PDFBibTeX XMLCite
Full Text: DOI