Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
| Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XII, 516 p.) |
| Disciplina | 005.73 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Computer mathematics Combinatorics Probabilities Data Structures Theory of Computation Computational Mathematics and Numerical Analysis Computation by Abstract Devices Probability Theory and Stochastic Processes |
| ISBN | 3-540-47501-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Methods in parallel algorithmics and who may need to know them? -- Rectilinear paths among rectilinear obstacles -- Linear time algorithms for k-cutwidth problem -- The k-edge-connectivity augmentation problem of weighted graphs -- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity -- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs -- Parallel and on-line graph coloring algorithms -- Competitive analysis of the Round Robin algorithm -- Competitive analysis of the on-line algorithms for multiple stacks systems -- Self-adjusting augmented search trees -- Algorithms for a class of Min-Cut and Max-Cut problem -- Algorithms for rectilinear optimal multicast tree problem -- Approximating treewidth and pathwidth of some classes of perfect graphs -- Graph spanners and connectivity -- Randomized range-maxima in nearly-constant parallel time -- Fault-tolerant broadcasting in binary jumping networks -- Routing problems on the mesh of buses -- Selection networks with 8n log2 n size and O(log n) depth -- Relativizations of the P=? NP and other problems: Some developments in structural complexity theory -- Boolean circuit complexity -- Searching a solid pseudo 3-sided orthoconvex grid -- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects -- Topologically consistent algorithms related to convex polyhedra -- Characterizing and recognizing visibility graphs of Funnel-shaped polygons -- On the complexity of composite numbers -- On malign input distributions for algorithms -- Lowness and the complexity of sparse and tally descriptions -- Honest iteration schemes of randomizing algorithms -- Approximating vertices of a convex polygon with grid points in the polygon -- Algorithms for determining the geometrical congruity in two and three dimensions -- On the relationships among constrained geometric structures -- Generating small convergent systems can be extremely hard -- Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems -- Higher order communicating processes with Value-Passing, Assignment and return of results -- Searching informed game trees -- How to generate realistic sample problems for network optimization -- Generalized assignment problems -- Recognizing an envelope of lines in linear time -- Approximation of polygonal curves with minimum number of line segments -- Wiring knock-knee layouts: A global approach -- Algorithms for finding non-crossing paths with minimum total length in plane graphs -- On symmetry of information and polynomial time invertibility -- On probabilistic ACC circuits with an exact-threshold output gate -- Computational and statistical indistinguishabilities -- On symmetric differences of NP-hard sets with weakly-P-selective sets -- Restricted track assignment with applications -- A simple test for the consecutive ones property -- The longest common subsequence problem for small alphabet size between many strings -- The implicit dictionary problem revisited -- Sorting in-place with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports -- Sorting and/by merging finger trees. |
| Record Nr. | UNISA-996465513903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings / / edited by Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita
| Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings / / edited by Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXIV, 380 p. 86 illus.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Application software Computer science Algorithms Data protection Computer Communication Networks Software Engineering Computer and Information Systems Applications Computer Science Logic and Foundations of Programming Data and Information Security |
| ISBN | 3-319-03089-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-stabilization -- Fault tolerance and dependability -- Formal methods and distributed systems -- Ad-hoc, sensors, mobile agents and robot networks -- P2P, social, self-organizing, autonomic and opportunistic networks. |
| Record Nr. | UNISA-996465473303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stabilization, Safety, and Security of Distributed Systems : 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings / / edited by Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita
| Stabilization, Safety, and Security of Distributed Systems : 15th International Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings / / edited by Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, Masafumi Yamashita |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXIV, 380 p. 86 illus.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Application software Computer science Algorithms Data protection Computer Communication Networks Software Engineering Computer and Information Systems Applications Computer Science Logic and Foundations of Programming Data and Information Security |
| ISBN | 3-319-03089-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-stabilization -- Fault tolerance and dependability -- Formal methods and distributed systems -- Ad-hoc, sensors, mobile agents and robot networks -- P2P, social, self-organizing, autonomic and opportunistic networks. |
| Record Nr. | UNINA-9910739411703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Structural Information and Communication Complexity [[electronic resource] ] : 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011 / / edited by Adrian Kosowski, Masafumi Yamashita
| Structural Information and Communication Complexity [[electronic resource] ] : 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011 / / edited by Adrian Kosowski, Masafumi Yamashita |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XI, 317 p. 45 illus., 9 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-642-22212-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465768603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||