×

zbMATH — the first resource for mathematics

Foundations of software technology and theoretical computer science. 15th conference, Bangalore, India, December 18–20, 1995. Proceedings. (English) Zbl 0856.00044
Lecture Notes in Computer Science. 1026. Berlin: Springer-Verlag. xii, 513 p. (1995).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference (14, 1994) has been reviewed (see Zbl 0802.00044).
Indexed articles:
Paterson, Mike; Tassa, Shlomit; Zwick, Uri, Looking for MUM and DAD: text-text comparisons do help, 1-10 [Zbl 1354.68309]
Jain, Sanjay, Branch and bound on the network model, 11-21 [Zbl 1354.68294]
Dasgupta, Pallas; Chakrabarti, P. P.; DeSarkar, S. C., A near optimal algorithm for the extended cow-path problem in the presence of relative errors, 22-36 [Zbl 1354.68238]
Roychoudhury, Abhik; Sur-Kolay, Susmita, Efficient algorithms for vertex arboricity of planar graphs, 37-51 [Zbl 1354.05135]
Diwan, Ajit A.; Usharani, N., A condition for the three colourability of planar locally path graphs, 52-61 [Zbl 1354.05046]
Baumann, Peter; Lermer, Karl, A framework for the specification of reactive and concurrent systems in Z, 62-79 [Zbl 1354.68166]
Zwiers, J.; Hannemann, U.; Lakhneche, Y.; de Roever, W.-P., Synthesizing different development paradigms: combining top-down with bottom-up reasoning about distributed systems, 80-95 [Zbl 1354.68182]
Hooman, Jozef, Verifying part of the ACCESS.bus protocol using PVS, 96-110 [Zbl 1354.68175]
Petrone, Luigi, Reusing batch parsers as incremental parsers, 111-123 [Zbl 1354.68160]
Panangaden, Prakash, The expressive power of indeterminate primitives in asynchronous computation, 124-150 [Zbl 1354.68080]
Garrigue, Jacques, The transformation calculus, 151-165 [Zbl 1354.68046]
Tiuryn, Jerzy, Equational axiomatization of bicoercibility for polymorphic types, 166-179 [Zbl 1354.68049]
Raynal, Michel; Schiper, André, From causal consistency to sequential consistency in shared memory systems, 180-194 [Zbl 1354.68024]
Tomlinson, Alexander I.; Garg, Vijay K., Observation of software for distributed systems with RCL, 195-209 [Zbl 1354.68025]
Dendris, Nick D.; Kirousis, Lefteris M.; Stamatiou, Yannis C.; Thilikos, Dimitris M., Partiality and approximation schemes for local consistency in networks of constraints, 210-224 [Zbl 1354.68208]
Kapur, Deepak; Sivakumar, G., Maximal extensions of simplification orderings, 225-239 [Zbl 1354.68142]
Schuler, Rainer, Average polynomial time is hard for exponential time under sn-reductions, 240-247 [Zbl 1354.68095]
Ravikumar, S.; Sivakumar, D., On self-testing without the generator bottleneck, 248-262 [Zbl 1354.68060]
Nielsen, Mogens; Cheng, Allan, Observing behaviour categorically, 263-278 [Zbl 1354.68200]
Caspi, Paul; Fernandez, Jean-Claude; Girault, Alain, An algorithm for reducing binary branchings, 279-293 [Zbl 1354.68051]
Boreale, Michele; Trevisan, Luca, On the complexity of bisimilarity for value-passing processes, 294-308 [Zbl 1354.68111]
Dsouza, Ashvin; Bloom, Bard, On the expressive power of CCS, 309-323 [Zbl 1354.68194]
Odersky, Martin, Polarized name passing, 324-337 [Zbl 1354.68201]
Balasubramanian, R.; Raman, Venkatesh, Path balance heuristic for self-adjusting binary search trees, 338-348 [Zbl 1354.68235]
Kosaraju, S. Rao, Pattern matching in compressed texts, 349-362 [Zbl 1354.68308]
Arikati, Srinivasa R.; Chaudhuri, Shiva; Zaroliagis, Christos D., All-pairs min-cut in sparse networks, 363-376 [Zbl 1354.68293]
Biswas, Sandip K.; Kannan, Sampath, Minimizing space usage in evaluation of expression trees, 377-390 [Zbl 1354.68107]
Edelsbrunner, Herbert, Smooth surfaces for multi-scale shape representation, 391-412 [Zbl 1354.68277]
Levcopoulos, Christos; Lingas, Andrzej; Wang, Cao, On parallel complexity of planar triangulations, 413-427 [Zbl 1354.68281]
Follert, Frank; Schömer, Elmar; Sellen, Jürgen; Smid, Michiel; Thiel, Christian, Computing a largest empty anchored cylinder, and related problems, 428-442 [Zbl 1354.68279]
Krznaric, Drago; Levcopoulos, Christos, Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time, 443-455 [Zbl 1354.68280]
Klarlund, Nils; Mukund, Madhavan; Sohoni, Milind, Determinizing Büchi asynchronous automata, 456-470 [Zbl 1354.68158]
Asarin, Eugene; Maler, Oded, Achilles and the tortoise climbing up the arithmetical hierarchy, 471-483 [Zbl 1354.03057]
Browne, I. A.; Manna, Z.; Sipma, H. B., Generalized temporal verification diagrams, 484-498 [Zbl 1354.68171]
Bianco, Andrea; de Alfaro, Luca, Model checking of probabilistic and nondeterministic systems, 499-513 [Zbl 1354.68167]
MSC:
00B25 Proceedings of conferences of miscellaneous specific interest
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
PDF BibTeX XML Cite
Full Text: DOI