Theoretical Computer Science - Proceedings Of The 10th Italian Conference On Ictcs '07
Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. Th...
Saved in:
| Main Author | |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Singapore
World Scientific Publishing Company
2007
World Scientific Publishing |
| Edition | 1 |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9812770992 9789812770998 9789812770981 9812770984 |
Cover
| Abstract | Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. The subjects of this book range from logical and mathematical aspects of computing, design and analysis of algorithms, to semantics of programming languages. |
|---|---|
| AbstractList | Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. The subjects of this book range from logical and mathematical aspects of computing, design and analysis of algorithms, to semantics of programming languages.Sample Chapter(s)Part A: Invited Talks: Clairvoyance and Laziness for on Line Travelling Agents (27 KB)Contents:Clairvoyance and Laziness for on Line Travelling Agents (G Ausiello)Symmetries in Foundations (G Longo)On the Approximability of Dense Steiner Tree Problems (M Hauptmann)Analyzing Non-Inteference with Respect to Classes (D Zanardini)Modeling Fuzzy Behaviours in Concurrent Systems (L D'Errico & M Loreti)Sorting Streamed Multisets (T Gagie)Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems (S Kosub & C M Homan)Definable Sets in Weak Presburger Arithmetic (C Choffrut & A Frigeri)and other papersReadership: Theoretical computer scientists. Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. The subjects of this book range from logical and mathematical aspects of computing, design and analysis of algorithms, to semantics of programming languages. |
| Author | Giuseppe F Italiano, Eugenio Moggi, Luigi Laura |
| Author_xml | – sequence: 1 fullname: Giuseppe F Italiano, Eugenio Moggi, Luigi Laura |
| BookMark | eNpN0E1LAzEQBuCIH9jW_gIvuRUPC9lNNh9HXaoWCitYvS5pOtuuXZOapPr3DW0R5zIMPDO8zBBdWGfhDA2VzAshiFLF-f_hCg2kUKRgOSuu0TiED5KKCkkVG6D3xQach9gZ3ePKfe72ETx-NR1YAzjDL94ZgFVn1wHXLU4a5yRu8CzqvtM2rdgW_AHXFs9MNAFPiLhBl63uA4xPfYTeHqeL6jmb10-z6n6eacYKkplSAzPEcK05NRKIkctStqsUjnPJNKNASt0uOVGaMzBS0BQmZyUvKVnRgo7Q3fGuDlv4CRvXx9B897B0bhsaJeTfH2Syk6Pdefe1hxCbAzNgo9d9M32oci6UJHmStycJvoe1a47nJJOkZPQXjkto9A |
| ContentType | eBook |
| DBID | YSPEL |
| DEWEY | 004 |
| DatabaseName | Perlego |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9812770992 9789812770998 |
| Edition | 1 |
| ExternalDocumentID | 9789812770998 EBC1679801 848054 |
| Genre | Electronic books |
| GroupedDBID | -VX 089 20A 38. 9WS A4I A4J AABBV AATMT ABARN ABCYV ABIAV ABMRC ABQPQ ACLGV ACZWY ADVEM AERYV AFOJC AHWGJ AIXPE AJFER AKHYG ALMA_UNASSIGNED_HOLDINGS AMYDA AZZ BBABE CZZ DUGUG EBSCA ECOWB GEOUK HF4 J-X JJU MYL PD6 PQQKQ PVBBV WMAQA XI1 YSPEL IVK |
| ID | FETCH-LOGICAL-a4420-c5ae4c0c6aa63c8e0c8b58fd7836684a43e05afb609a64ec873eed1456530d323 |
| ISBN | 9812770992 9789812770998 9789812770981 9812770984 |
| IngestDate | Fri Nov 08 00:00:07 EST 2024 Wed Oct 29 01:19:49 EDT 2025 Tue Sep 30 18:21:29 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA75.5.I28 2007 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a4420-c5ae4c0c6aa63c8e0c8b58fd7836684a43e05afb609a64ec873eed1456530d323 |
| OCLC | 879024142 |
| PQID | EBC1679801 |
| PageCount | 1 online resource (216 pages) |
| ParticipantIDs | askewsholts_vlebooks_9789812770998 proquest_ebookcentral_EBC1679801 perlego_books_848054 |
| PublicationCentury | 2000 |
| PublicationDate | 2007 2007-09-06 |
| PublicationDateYYYYMMDD | 2007-01-01 2007-09-06 |
| PublicationDate_xml | – year: 2007 text: 2007 |
| PublicationDecade | 2000 |
| PublicationPlace | Singapore |
| PublicationPlace_xml | – name: Singapore |
| PublicationYear | 2007 |
| Publisher | World Scientific Publishing Company World Scientific Publishing |
| Publisher_xml | – name: World Scientific Publishing Company – name: World Scientific Publishing |
| SSID | ssj0000378394 |
| Score | 1.8158284 |
| Snippet | Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments... |
| SourceID | askewsholts proquest perlego |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer science Congresses SCIENCE |
| TableOfContents | 3.4. Axioms for Non-Recursive Well-Prioritized Terms -- 4. Conclusion -- References -- Analyzing Non-Interference with Respect to Classes D. Zanardini -- 1. Introduction -- 2. Preliminaries -- 3. Class-Oriented Abstract Non-Interference -- 4. ANI Analysis for Class Information -- 5. An Example -- 6. Conclusions and FutureWork -- References -- Computing Minimum Directed Feedback Vertex Set in O (1:9977n) I. Razgon -- 1. Introduction -- 2. Preliminaries -- 3. The Algorithm -- 4. Analysis -- Acknowledgements -- References -- Seeing the Trees and their Branches in the Network is Hard I. A. Kanj, L. Nakhleh, C. Than, and G. Xia -- 1. Introduction -- 2. Phylogenetic Networks, Trees, and the Infinite Site Model -- 3. Computational Complexity of the TC Problem -- 4. The ISPN Problem: Complexity and a Parameterized Algorithm -- 4.1. NP-completeness of ISPN -- 4.2. A Parameterized Algorithm for ISPN -- 5. The Cluster Containment Problem -- Bibliography -- Modeling Fuzzy Behaviours in Concurrent Systems L. D'Errico and M. Loreti -- 1. Introduction -- 2. Fuzzy Sets -- 3. Fuzzy Labelled Transition Systems -- 4. Fuzzy Hennessy-Milner Logic -- 4.1. FHML with recursion -- 5. Conclusions and FutureWorks -- Bibliography -- A Formal Framework for Compositional Compilation D. Ancona and E. Zucca -- 1. Introduction -- 2. An abstract framework -- 3. Linking by entailment -- 4. Compositional compilation and principal typings -- 5. Linking by environment entailment and subtyping -- 6. Conclusion -- Acknowledgements -- Bibliography -- Type Inference for Polymorphic Methods in Java-like Languages D. Ancona, G. Lagorio, and E. Zucca -- 1. Introduction -- 2. A type system with polymorphic method types -- 3. Inferring polymorphic method types -- 4. Related and further work -- Bibliography -- Sorting Streamed Multisets T. Gagie -- 1. Introduction -- 2. Algorithm -- 3. Lower Bound Intro -- CONTENTS -- Preface -- A Short Research Biography of Mario Coppo, Mariangiola Dezani-Ciancaglini, and Simona Ronchi Della Rocca -- ICTCS 2007: October 3-5 2007, Rome, Italy -- Part A Invited Talks -- Clairvoyance and Laziness for on Line Travelling Agents G. Ausiello -- Proving the Range Property for Lambda Theories and Models H. Barendregt -- Can a Proper Lambda-Model have an R.E. Equational Theory? C. Berline -- Bibliography -- Session Centered Calculi for Service Oriented Computing R. De Nicola -- 1. Introduction -- Acknowledgments -- Bibliography -- Symmetries in Foundations G. Longo -- Bibliography -- Part B Regular Contributions -- On the Approximability of Dense Steiner Tree Problems M. Hauptmann -- 1. Introduction -- 2. Exact Algorithms for the Steiner Tree Problem -- 3. The -Dense Steiner Tree Problem -- 3.1. Towards Average-Density: Relaxing the Density Condition -- 4. The Dense Steiner Forest Problem -- 5. Conclusion -- References -- Weak Pattern Matching in Colored Graphs: Minimizing the Number of Connected Components R. Dondi, G. Fertin, and S. Vialette -- 1. Introduction -- 2. Preliminaries -- 3. Hardness result for paths -- 4. Fixed-parameter algorithms -- 4.1. The MIN-CC problem is fixed-parameter tractable -- 4.2. A faster fixed-parameter algorithm for trees -- 5. A polynomial-time algorithm for paths with a bounded number of colors -- 6. Hardness of approximation for trees -- 7. An exact algorithm for trees -- 8. Conclusion -- Bibliography -- Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions M. Bernardo and A. Aldini -- 1. Introduction -- 2. Extended Markovian Process Algebra -- 3. Weak Extended Markovian Bisimilarity -- 3.1. Extended Markovian Bisimilarity -- 3.2. Abstracting from Internal Immediate Actions -- 3.3. Congruence Result for Well-Prioritized Terms 4. FutureWork -- Acknowledgments -- Bibliography -- An Analysis of a Simple Algorithm for Random Derangements D. Merlini, R. Sprugnoli, and M. C. Verri -- 1. Introduction -- 2. Derangements -- 3. The Triangle of First Fixed Points -- 4. Mean and Variance -- Acknowledgements -- Bibliography -- The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes M. Hauptmann -- 1. Introduction -- 2. Preliminaries -- 3. Separating PTAS from EPTAS -- 4. Oracle Constructions -- 5. Conclusion -- Bibliography -- Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems S. Kosub and C. M. Homan -- 1. Introduction -- 2. The Dynamical Systems Framework -- 3. The Analysis Framework -- 3.1. Transition Classes -- 3.2. Network Classes -- 4. Islands of Tractability for Fixed Point Counting -- 4.1. The Case of Local Transition Functions Given By Lookup Tables -- 4.2. Succinctly Represented Local Transition Functions -- 5. Conclusion -- Bibliography -- Definable Sets in Weak Presburger Arithmetic C. Choffrut and A. Frigeri -- Introduction -- 1. Preliminaries -- 1.1. Variants of Presburger arithmetic -- 1.2. Logical definability -- 2. N-linear and Z-linear sets -- 2.1. Some notations -- 2.2. Linear sets -- 3. Properties of Z-linear sets -- 3.1. Closure properties -- 3.2. Quasisimple sets -- 4. Definable sets in weak Presburger arithmetic -- 4.1. An algebraic characterization of definable sets -- 4.2. A special case -- 4.3. The procedure -- Bibliography -- On Defining Proofs of Knowledge in the Bare Public-key Model G. Di Crescenzo and I. Visconti -- 1. Introduction -- 2. Defining Proofs of Knowledge in the BPK Model -- 3. Separating the Notions ofWitness Extraction -- 4. ConcurrentWitness Extraction -- Acknowledgments. -- Bibliography -- Author Index |
| Title | Theoretical Computer Science - Proceedings Of The 10th Italian Conference On Ictcs '07 |
| URI | https://www.perlego.com/book/848054/theoretical-computer-science-proceedings-of-the-10th-italian-conference-on-ictcs-07-pdf https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=1679801 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9789812770998&uid=none |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELZ4XOBSXlW3LchClXqIUjmxEzu9AQplEZCV2K24RY7jgAQKFZv20F_fsTfrZLccgEsU24kTfZPMyzMehL5QmlAjXHwhNfEZ5RL4YFn6odm9nALHDGy0--VVfDZh5zfRTVcTz2aXNMU39ffZvJK3UBX6gK4mS_YVlHWTQgecA33hCBSG45Ly65qOuC79cF6Xwf2mxsgfObk09bLKxlUEpLnzhs3Mr9El-nlZ7Q1Vo4z3lRMnlY4uLPcYm4LKV5n3Yzi5Tkej1Dv10vGCp4DbUKi440c2Ose-iw1D6jm6FozKBGQ-5ySZlVJZ2o26N56IVbTKObCVdRCh6aVzbRHKQe2a7brYmw1sYtdgm2hTTu-BjwOPb6ZgfPzSTw_69vE_kWjl_HgLrWuT_LGNVnS9g97NocUttLvoZw95vDyMv-Me7jirMFyNDe64xR13uOOsxhZ3_JXwPTQ5TccnZ35bmsKXjIHBrSKpmSIqljKmSmiiRBGJqjQ5MbFgklFNIlkVMUlkzLQSnMLDA6M-U1LSkL5Ha_VjrT8gbColV7riZQm6aShDqaUMVRxIHXFSFOUAHfaQyv882FX0ab5AiQHabQHMZ6OCCVDGBwjP0cztbW3Eb54en9j1NxJ8fMn0n9BG90F9RmvN02-9D8pYUxy0xP8HigswMA |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Theoretical+Computer+Science+%3A+Proceedings+Of+The+10th+Italian+Conference+On+Ictcs+%2707&rft.au=AL%2C+ITALIANO+GIUSEPPE+F+ET&rft.date=2007-09-06&rft.pub=World+Scientific+Publishing&rft.isbn=9789812770981&rft.externalDocID=9789812770998 |
| thumbnail_l | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.perlego.com%2Fbooks%2FRM_Books%2Fworld_scientific_pub_rlpceeul%2F9789812770998.jpg |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97898127%2F9789812770998.jpg |