Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 13-15, 1999 : proceedings

保存先:
書誌詳細
団体著者: Conference on foundations of software technology and theoretical computer science :Chennai, Inde
その他の著者: Pandu Rangan, C., 1955- (出版デイレクター), Raman, Venkatesh, 1962- (出版デイレクター), Ramanujam, Ramaswamy, 1959- (出版デイレクター)
フォーマット: Livre numérique
言語:Anglais
出版事項: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
シリーズ:Lecture notes in computer science 1738
主題:
オンライン・アクセス:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
注記: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Foundations of software technology and theoretical computer science, 19th conference, Chennai, India, December 1999, proceedings, C. Pandu Rangan, V. Raman, R. Ramanujam (eds.), 1999, Berlin, Springer, 1 vol. (XII-452 p.), Lecture notes in computer science, 3-540-66836-5
• Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662191729
LEADER 05057nam a22003977a 4500
001 972287
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155221574
020 |a 9783540466918 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Conference on foundations of software technology and theoretical computer science  |n (19  |d  :1999  |c  :Chennai, Inde). 
245 1 0 |a Foundations of software technology and theoretical computer science :  |b 19th conference, Chennai, India, December 13-15, 1999 : proceedings   |c [edited by] C. Pandu Rangan, V. Raman, R. Ramanujam. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1738  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Invited Talk 1 -- Recent Developments in the Theory of Arrangements of Surfaces -- Session 1(a) -- Dynamic Compressed Hyperoctrees with Application to the N-body Problem -- Largest Empty Rectangle among a Point Set -- Session 1(b) -- Renaming Is Necessary in Timed Regular Expressions -- Product Interval Automata: A Subclass of Timed Automata -- Session 2(a) -- The Complexity of Rebalancing a Binary Search Tree -- Fast Allocation and Deallocation with an Improved Buddy System -- Session 2(b) -- Optimal Bounds for Transformations of ?-Automata -- CTL+ Is Exponentially More Succinct than CTL -- Invited Talk 2 -- A Top-Down Look at a Secure Message -- Session 3 -- Explaining Updates by Minimal Sums -- A Foundation for Hybrid Knowledge Bases -- Session 4 -- Hoare Logic for Mutual Recursion and Local Variables -- Invited Talk 3 -- Explicit Substitutions and Programming Languages -- Session 5(a) -- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings -- A Randomized Algorithm for Flow Shop Scheduling -- Session 5(b) -- Synthesizing Distributed Transition Systems from Global Specifications -- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata -- Session 6 -- Implicit Temporal Query Languages: Towards Completeness -- On the Undecidability of Some Sub-classical First-Order Logics -- Invited Talk 4 -- How to Compute with DNA -- Session 7(a) -- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles -- Protecting Facets in Layered Manufacturing -- Session 7(b) -- The Receptive Distributed ?-Calculus -- Series and Parallel Operations on Pomsets -- Session 8 -- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus -- Invited Talk 5 -- Graph Isomorphism: Its Complexity and Algorithms -- Session9(a) -- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables -- Lower Bounds for Linear Transformed OBDDs and FBDDs -- Session 9(b) -- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems -- Graded Modalities and Resource Bisimulation -- Session 10(a) -- The Non-recursive Power of Erroneous Computation -- Analysis of Quantum Functions -- Session 10(b) -- On Sets Growing Continuously -- Model Checking Knowledge and Time in Systems with Perfect Recall -- FST&TCS ISAAC Joint Session Talks -- The Engineering of Some Bipartite Matching Programs. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
650 |a Génie logiciel 
650 |a Informatique 
650 |a Ordinateurs 
650 |a Actes de congrès 
700 1 |a Pandu Rangan, C.,  |d 1955-  |4 pbd 
700 1 |a Raman, Venkatesh,  |d 1962-  |4 pbd 
700 1 |a Ramanujam, Ramaswamy,  |d 1959-  |4 pbd 
776 0 |0 049119419  |t Foundations of software technology and theoretical computer science  |o 19th conference, Chennai, India, December 1999  |o proceedings  |f C. Pandu Rangan, V. Raman, R. Ramanujam (eds.)  |d 1999  |c Berlin  |n Springer  |p 1 vol. (XII-452 p.)  |s Lecture notes in computer science  |z 3-540-66836-5 
776 0 |t Foundations of Software Technology and Theoretical Computer Science  |b Texte imprimé  |z 9783662191729 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-46691-6  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-BS92HV62-J  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750643196  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-46691-6  |z Accès Université d'Orléans 
856 4 |5 180339901:75399433X  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-46691-6  |z Accès INSA CVL 
997 |0 972287  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/