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.
Optimal graph clustering problems with applications to information system design
| Optimal graph clustering problems with applications to information system design |
| Creatore | [University of Michigan. Computing Research Laboratory CRL-TR-30-84] |
| Accesso persona | Chiang, W. P. |
| Soggetto non controllato |
Thesis (Ph.D.).
Computational complexity Database design Directed graphs NP-complete problems Undirected graphs |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4601673 |
[University of Michigan. Computing Research Laboratory CRL-TR-30-84]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Topics in combinatorial algorithms
| Topics in combinatorial algorithms |
| Creatore | [University of Illinois at Urbana-Champaign. Department of Computer Science UIUCDCS-R-85-1204] |
| Accesso persona | Ramanan, P. V. |
| Soggetto non controllato |
Thesis (Ph.D.).
Computational complexity Data structures NP-completeness Permutation representation Tree traversals |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4602781 |
|
[University of Illinois at Urbana-Champaign. Department of Computer Science UIUCDCS-R-85-1204]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Topics in cryptology-- CT-RSA 2012 : the Cryptographers' track at the RSA Conference 2012, San Francisco, CA, USA, February 27-March 2, 2012. Proceedings / Orr Dunkelman (ed.).
| Topics in cryptology-- CT-RSA 2012 : the Cryptographers' track at the RSA Conference 2012, San Francisco, CA, USA, February 27-March 2, 2012. Proceedings / Orr Dunkelman (ed.). |
| Creatore | [Cryptographers' Track at RSA Conference (2012 : San Francisco, Calif.)] |
| Estensione | 1 online resource (xiii, 434 pages) |
| Disciplina | 005.8/2 |
| Accesso persona | Dunkelman, Orr. |
| Soggetto non controllato |
Computer science
Computer Communication Networks Data protection Data encryption (Computer science) Computer software Computational complexity Discrete Mathematics in Computer Science Systems and Data Security Algorithm Analysis and Problem Complexity algoritmen algorithms computeranalyse computer analysis wiskunde mathematics computerwetenschappen computer sciences computernetwerken computer networks gegevensbeheer data management Information and Communication Technology (General) Informatie- en communicatietechnologie (algemeen) |
| ISBN |
9783642279546
3642279546 9783642279539 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a9547316 |
|
[Cryptographers' Track at RSA Conference (2012 : San Francisco, Calif.)]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Mathematical modelling and scientific computation : International Conference, ICMMSC 2012, Gandhigram, Tamil Nadu, India, March 16-18, 2012. Proceedings / P. Balasubramaniam, R. Uthayakumar (eds.).
| Mathematical modelling and scientific computation : International Conference, ICMMSC 2012, Gandhigram, Tamil Nadu, India, March 16-18, 2012. Proceedings / P. Balasubramaniam, R. Uthayakumar (eds.). |
| Creatore | [International Conference on Mathematical Modelling and Scientific Computation (2012 : Gandhigram, India)] |
| Estensione | 1 online resource (xiii, 554 pages) : illustrations |
| Disciplina | 511/.8 |
| Accesso persona |
Balasubramaniam, P., 1967-
Uthayakumar, R. |
| Soggetto non controllato |
Computer science
Electronic data processing Computational complexity Mathematical optimization Engineering mathematics Numeric Computing Discrete Mathematics in Computer Science Probability and Statistics in Computer Science Computational Science and Engineering Optimization Appl. Mathematics/Computational Methods of Engineering |
| ISBN |
9783642289262
3642289266 3642289258 9783642289255 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a9547397 |
|
[International Conference on Mathematical Modelling and Scientific Computation (2012 : Gandhigram, India)]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Acyclic hypergraph projections and relationships to circular-arc graphs and circular representable hypergraphs
| Acyclic hypergraph projections and relationships to circular-arc graphs and circular representable hypergraphs |
| Creatore | [Ṭekhniyon, Makhon ṭekhnologi le-Yiśraʼel. Maḥlaḳah le-madaʻe ha-maḥshev 385.] |
| Accesso persona | Shmueli, O. |
| Accesso ente | TECHNION - Israel Institute of Technology |
| Soggetto non controllato |
Computational complexity
Relational databases Tree projection |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4607388 |
|
[Ṭekhniyon, Makhon ṭekhnologi le-Yiśraʼel. Maḥlaḳah le-madaʻe ha-maḥshev 385.]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Product graphs: some algorithmic and combinatorial results
| Product graphs: some algorithmic and combinatorial results |
| Creatore | [Stanford University. Computer Science Department STAN-CS-86-1121] |
| Estensione | 60p. |
| Accesso persona | Feigenbaum, J. |
| Soggetto non controllato |
Thesis (Ph.D.).
Cartesian products Composition operator Computational complexity Connected digraphs Graph factoring Graph isomorphism Graph irreducibility Minimal factorable extensions Polynomial time algorithms Prime factors Prime graphs Winkler's method |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4608126 |
|
[Stanford University. Computer Science Department STAN-CS-86-1121]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
On moving and orienting objects
| On moving and orienting objects |
| Creatore | [Cornell University. Department of Computer Science TR-86-775] |
| Estensione | 81 p. |
| Accesso persona | Natarajan, B. K. |
| Soggetto non controllato |
Thesis (Ph.D.).
Computational complexity Damping Function composition on finite sets Motion planning Object orientation Parts assembly Pebbling Polynomial time algorithms Position measurement Robot manipulators |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4610299 |
|
[Cornell University. Department of Computer Science TR-86-775]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
On the effects of feedback in dynamic network protocols
| On the effects of feedback in dynamic network protocols |
| Creatore | [Massachusetts Institute of Technology. Laboratory for Computer Science MIT/LCS/TM-375] |
| Accesso persona | Awerbuch, B. |
| Soggetto non controllato |
Adaptive protocols
Amortized analysis Asynchronicity Communication protocols Computational complexity Convergence Dynamic networks Potential functions |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4616467 |
|
[Massachusetts Institute of Technology. Laboratory for Computer Science MIT/LCS/TM-375]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Efficiency of the network simplex algorithm for the maximum flow problem
| Efficiency of the network simplex algorithm for the maximum flow problem |
| Creatore | [Princeton University. Department of Computer Science CS-TR-193-88] |
| Accesso persona |
Goldberg, A. V.
Grigoriadis, M. D. Tarjan, R. E. |
| Soggetto non controllato |
Algorithms
Computational complexity Data structures Dynamic trees Graphs Linear programming Network flow Network optimization |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4616512 |
|
[Princeton University. Department of Computer Science CS-TR-193-88]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
Efficiency of the network simplex algorithm for the maximum flow problem
| Efficiency of the network simplex algorithm for the maximum flow problem |
| Creatore | [Rutgers University. Department of Computer Science LCSR-TR-117] |
| Accesso persona |
Goldberg, A. V.
Grigoriadis, M. D. Tarjan, R. E. |
| Accesso ente | Rutgers University. Laboratory for Computer Science Research |
| Soggetto non controllato |
Algorithms
Computational complexity Data structures Dynamic trees Graphs Linear programming Network flow Network optimization |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | STANFORD-a4616853 |
|
[Rutgers University. Department of Computer Science LCSR-TR-117]
|
|
| Materiale a stampa | |
| Lo trovi qui: Stanford University | |
