Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings

The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data str...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Erakunde egilea: Italian Conference on Algorithms and complexity :Rome
Beste egile batzuk: Bonuccelli, Maurizio A. (Argitalpenaren zuzendaria), Crescenzi, Pierluigi, 1961- (Argitalpenaren zuzendaria), Petreschi, Rossella, 1950- (Argitalpenaren zuzendaria)
Formatua: Livre numérique
Hizkuntza:Anglais
Argitaratua: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Saila:Lecture notes in computer science 778
Gaiak:
Sarrera elektronikoa:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Oharra: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithms and complexity, second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994, proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.), Berlin, Springer-Verlag, 1994, 1 vol. (VIII-222 p.), Lecture notes in computer science, 0-387-57811-0
• Algorithms and Complexity, Texte imprimé, 9783662193198
LEADER 04260nam a22004337a 4500
001 945144
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155215981
020 |a 9783540483373 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Italian Conference on Algorithms and complexity  |n (02  |d  :1994  |c  :Rome). 
245 1 0 |a Algorithms and complexity :  |b second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings   |c [edited by] M. Bonuccelli, P. Crescenzi, R. Petreschi. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 778  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a On the intellectual terrain around NP -- Advances in graph drawing -- On a parallel-algorithms method for string matching problems (overview) -- Some open problems in approximation -- New local search approximation techniques for maximum generalized satisfiability problems -- Learning behaviors of automata from multiplicity and equivalence queries -- Measures of Boolean function complexity based on Harmonic Analysis -- Graph theory and interactive protocols for Reachability Problems on finite Cellular automata -- Parallel pruning decomposition (PDS) and biconnected components of graphs -- A non-interactive electronic cash system -- A unified scheme for routing in expander based networks -- Dynamization of backtrack-free search for the constraint satisfaction problem -- Efficient reorganization of binary search trees -- Time-message trade-offs for the weak unison problem -- On set equality-testing -- On the complexity of some reachability problems -- On self-reducible sets of low information content -- Lower bounds for merging on the hypercube. 
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 
520 |a The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Complexité de calcul (informatique) 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Bonuccelli, Maurizio A.  |4 pbd 
700 1 |a Crescenzi, Pierluigi,  |d 1961-  |4 pbd 
700 1 |a Petreschi, Rossella,  |d 1950-  |4 pbd 
776 0 |0 018245889  |t Algorithms and complexity  |o second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994  |o proceedings  |f M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)  |c Berlin  |n Springer-Verlag  |d 1994  |p 1 vol. (VIII-222 p.)  |s Lecture notes in computer science  |z 0-387-57811-0 
776 0 |t Algorithms and Complexity  |b Texte imprimé  |z 9783662193198 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-57811-0  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-NVPD18WN-7  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747913315  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-57811-0  |z Accès Université d'Orléans 
856 4 |5 180339901:750926082  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-57811-0  |z Accès INSA CVL 
997 |0 945144  |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/