{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[21,2,21,3],[22,2,22,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466161303316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings / / edited by Zoltan Fülöp, Ferenc Gecseg"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995"]
[null,null,"ISBN",null,"3-540-49425-1"]
[null,null,"Edizione",null,"[1st ed. 1995.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVI, 692 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 944"]
[null,null,"Disciplina",null,"629.892"]
[null,null,"Soggetti",null,"Robotics"]
[{"$nulls":4},"Automation"]
[{"$nulls":4},"Programming languages (Electronic computers)"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Robotics and Automation"]
[{"$nulls":4},"Programming Languages, Compilers, Interpreters"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Cryptology"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Theory of 2-structures -- A domain for concurrent termination a generalization of Mazurkiewicz traces -- Nonfinite axiomatizability of the equational theory of shuffle -- The algebraic equivalent of AFL theory -- Finite state transformations of images -- Post correspondence problem: Words possible as primitive solutions -- Computing the closure of sets of words under partial commutations -- Intervalizing k-colored graphs -- NC algorithms for finding a maximal set of paths with application to compressing strings -- On the construction of classes of suffix trees for square matrices: Algorithms and applications -- How to use the minimal separators of a graph for its chordal triangulation -- Fast gossiping by short messages -- Break "]
[{"$nulls":4},"Finite Automata Public Key Cryptosystem -- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time -- On the number of random bits in totally private computation -- Lower time bounds for randomized computation -- New collapse consequences of NP having small circuits -- The complexity of searching succinctly represented graphs -- Optimal shooting: Characterizations and applications -- Placing resources in a tree: Dynamic and static algorithms -- Shortest path queries in digraphs of small treewidth -- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs -- Parallel algorithms with optimal speedup for bounded treewidth -- Approximating minimum cuts under insertions -- Linear time algorithms for dominating pairs in asteroidal triple-free graphs -- On-line resource management with applications to routing and scheduling -- Alternation in simple devices -- Hybrid automata with finite bisimulations -- Generalized Sturmian languages -- Polynomial closure and unambiguous product -- Lower bounds on algebraic random access machines -- Improved deterministic PRAM simulation on the mesh -- On optimal polynomial time approximations: P-levelability vs. ?-levelability -- Weakly useful sequences -- Graph Connectivity, Monadic NP and built-in relations of moderate degree -- The expressive power of clocks -- Grammar systems: A grammatical approach to distribution and cooperation -- Compactness of systems of equations in semigroups -- Sensing versus nonsensing automata -- New upper bounds for generalized intersection searching problems -- OKFDDs versus OBDDs and OFDDs -- Bicriteria network design problems -- On determining optimal strategies in pursuit games in the plane -- Extension orderings -- The pushdown method to optimize chain logic programs -- Automatic synthesis of real time systems -- Self-correcting for function fields of finite transcendental degree -- Measure, category and learning theory -- A characterization of the existence of energies for neural networks -- Variable-length codes for error correction -- Graphbots: Mobility in discrete spaces -- Solving recursive net equations -- Implicit definability and infinitary logic in finite model theory -- The limit of splitn-language equivalence -- Divergence and fair testing -- Causality for mobile processes -- Internal mobility and agent-passing calculi."]
[null,null,null,"Sommario/riassunto","This volume constitutes the proceedings of the 22nd Interna- tional Colloquium on Automata, Languages, and Programming, held under the sponsorship of EATCS in Szeged, Hungary in July 1995. The volume presents four invited papers and 53 full revised research papers selected from a total of 111 submissions. 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."]