HOME > Detail View

Detail View

Mathematical foundations of computer science, 1990 : Banska Bystrica, Czechoslovakia, August 27-31, 1990 : proceedings

Mathematical foundations of computer science, 1990 : Banska Bystrica, Czechoslovakia, August 27-31, 1990 : proceedings (Loan 1 times)

Material type
단행본
Personal Author
Rovan, B. (Branislav).
Title Statement
Mathematical foundations of computer science, 1990 : Banska Bystrica, Czechoslovakia, August 27-31, 1990 : proceedings / B. Rovan, ed.
Publication, Distribution, etc
Berlin ;   New York :   Springer-Verlag,   c1990.  
Physical Medium
viii, 544 p. ; 25 cm.
Series Statement
Lecture notes in computer science ;452.
ISBN
3540529535 : 0387529535
General Note
Papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, held in Banska Bystrica, Czechoslovakia, Aug. 27-31, 1990.  
Subject Added Entry-Topical Term
Computer science --Mathematics --Congresses.
000 01119camuuu200253 a 4500
001 000000901611
005 19990209152625.0
008 900731s1990 wb 10000 engx
010 ▼a 90010166
020 ▼a 3540529535 : ▼c DM69.00
020 ▼a 0387529535
040 ▼a DLC ▼c DLC ▼d DLC ▼d 244002
049 0 ▼l 452076104 ▼v 452
050 0 0 ▼a QA76.9.M35 ▼b M386 1990
082 0 0 ▼a 004/.01/51 ▼2 20
090 ▼a 004.1 ▼b L471 ▼c 452
245 0 0 ▼a Mathematical foundations of computer science, 1990 : ▼b Banska Bystrica, Czechoslovakia, August 27-31, 1990 : proceedings / ▼c B. Rovan, ed.
260 ▼a Berlin ; ▼a New York : ▼b Springer-Verlag, ▼c c1990.
300 ▼a viii, 544 p. ; ▼c 25 cm.
440 0 ▼a Lecture notes in computer science ; ▼v 452.
500 ▼a Papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, held in Banska Bystrica, Czechoslovakia, Aug. 27-31, 1990.
650 0 ▼a Computer science ▼x Mathematics ▼x Congresses.
700 1 ▼a Rovan, B. ▼q (Branislav).
711 2 ▼a Symposium on Mathematical Foundations of Computer Science (1972- ) ▼n (15th : ▼d 1990 : ▼c Banska Bystrica, Czechoslovakia)

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Sejong Academic Information Center/Science & Technology/ Call Number 004.1 L471 452 Accession No. 452076104 Availability Available Due Date Make a Reservation Service C

Contents information

Table of Contents

A logical operational semantics of full Prolog.- Syntactic theories.- On kleene algebras and closed semirings.- Interactive computations of optimal solutions.- Restricted branching programs and their computational power.- Dynamic hashing strategies.- One-way functions in complexity theory.- Type inference problems: A survey.- Counting the number of solutions.- Implementation of parallel graph reduction by explicit annotation and program transformation.- Interrogative complexity of ?-languages' recognition.- On the power of uniform families of constant depth threshold circuits.- Separating sets of hyperrectangles.- On preemptive scheduling of periodic, real-time tasks on one processor.- Retractions in comparing prolog semantics (extended abstract).- Using inductive counting to simulate nondeterministic computation.- Some properties of zerotesting bounded one-way multicounter machines.- On fast algorithms for two servers.- Decomposition of semi commutations.- Parallel construction of minimal suffix and factor automata.- Affine automata: A technique to generate complex images.- The complexity of symmetric functions in parity normal forms.- Event structures, causal trees, and refinements.- Query languages which express all PTIME queries for trees and unicyclic graphs.- Comparisons among classes of Y-tree systolic automata.- On checking versus evaluation of multiple queries.- Generalized kolmogorov complexity in relativized separations.- A first-order logic for partial recursive functions.- Speed-up theorem without tape compression.- On possibilities of one-way synchronized and alternating automata.- Unrestricted resolution versus N-resolution.- Quality criteria for partial order semantics of place/transition-nets.- Tree-stack automata.- Specification & verification of higher order processes.- The membership problem for context-free chain code picture languages.- Optimal algorithms for dissemination of information in some interconnection networks.- A hierarchy of compositional models of I/O-automata (Extended Abstract).- Minimal nontrivial space complexity of probabilistic one- way turing machines.- On the complexity of genuinely polynomial computation.- Pumping lemmrs for tree languages generated by rewrite systems.- Vector language: Simple description of hard instances.- Separating ?L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time.- The use of graphs of elliptical influence in visual hierarchical clustering.- Characterizing unambiguous augmented pushdown automata by circuits.- Rational ?-transductions.- Splitsort-an adaptive sorting algorithm.- Equational calculi for many-sorted algebras with empty carrier sets.- Semi-commutation and deterministic petri nets.- Internal labellings in lambda-calculus.- A sup-preserving completion of ordered partial algebras.- ATIME(n) is closed under Counting.- Investigation of finitary calculi for the temporal logics by means of infinitary calculi.- Typed horn logic (extended abstract).- Results on the glory of the past.- A stronger version of parikh theorem.- The parallel complexity of some constructions in combinatorial group theory (abstract).- Gentzen type axiomatization for PAL.- Distance automata having large finite distance or finite ambiguity.- Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small).- Symmetric functions in AC 0 can be computed in constant depth with very small size.- The k-section of treewidth restricted graphs.- Computing large polynomial powers very fast in parallel.


Information Provided By: : Aladin

New Arrivals Books in Related Fields