Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
There’s plenty of room at the Top: What will drive computer performance after Moore’s law?Leiserson, Charles E. ; Thompson, Neil C. ; Emer, Joel S. ; Kuszmaul, Bradley C. ; Lampson, Butler W. ; Sanchez, Daniel ; Schardl, Tao B.Science (American Association for the Advancement of Science), 2020-06, Vol.368 (6495) [Periódico revisado por pares]Washington: The American Association for the Advancement of ScienceTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Limits on fundamental limits to computationMarkov, Igor LNature (London), 2014-08, Vol.512 (7513), p.147-154 [Periódico revisado por pares]England: Nature Publishing GroupTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
A scalable realization of local U(1) gauge invariance in cold atomic mixturesMil, Alexander ; Zache, Torsten V ; Hegde, Apoorva ; Xia, Andy ; Bhatt, Rohit P ; Oberthaler, Markus K ; Hauke, Philipp ; Berges, Jürgen ; Jendrzejewski, FredScience (American Association for the Advancement of Science), 2020-03, Vol.367 (6482), p.1128-1130 [Periódico revisado por pares]United States: The American Association for the Advancement of ScienceTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Quantum internet: A vision for the road aheadWehner, Stephanie ; Elkouss, David ; Hanson, RonaldScience (American Association for the Advancement of Science), 2018-10, Vol.362 (6412) [Periódico revisado por pares]United States: The American Association for the Advancement of ScienceTexto completo disponível |
5 |
Material Type: Livro
|
![]() |
Algorithms and data structures for external memoryVitter, Jeffrey ScottFoundations and trends in theoretical computer science, 2008, Vol.2 (4), p.305-474 [Periódico revisado por pares]Hanover, Mass: Now PublishersTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Quantum computational advantage with a programmable photonic processorMadsen, Lars S ; Laudenbach, Fabian ; Askarani, Mohsen Falamarzi ; Rortais, Fabien ; Vincent, Trevor ; Bulmer, Jacob F F ; Miatto, Filippo M ; Neuhaus, Leonhard ; Helt, Lukas G ; Collins, Matthew J ; Lita, Adriana E ; Gerrits, Thomas ; Nam, Sae Woo ; Vaidya, Varun D ; Menotti, Matteo ; Dhand, Ish ; Vernon, Zachary ; Quesada, Nicolás ; Lavoie, JonathanNature (London), 2022-06, Vol.606 (7912), p.75-81 [Periódico revisado por pares]England: Nature Publishing GroupTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
A robotic platform for flow synthesis of organic compounds informed by AI planningColey, Connor W ; Thomas, 3rd, Dale A ; Lummiss, Justin A M ; Jaworski, Jonathan N ; Breen, Christopher P ; Schultz, Victor ; Hart, Travis ; Fishman, Joshua S ; Rogers, Luke ; Gao, Hanyu ; Hicklin, Robert W ; Plehiers, Pieter P ; Byington, Joshua ; Piotti, John S ; Green, William H ; Hart, A John ; Jamison, Timothy F ; Jensen, Klavs FScience (American Association for the Advancement of Science), 2019-08, Vol.365 (6453) [Periódico revisado por pares]United States: The American Association for the Advancement of ScienceTexto completo disponível |
8 |
Material Type: Livro
|
![]() |
The design of competitive online algorithms via a primal-dual approachBuchbinder, Niv ; Naor, Joseph (Seffi)Foundations and trends in theoretical computer science, 2009, Vol.3 (2/3), p.93-263 [Periódico revisado por pares]Hanover, Mass: Now PublishersTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Quantum machine learningBiamonte, Jacob ; Wittek, Peter ; Pancotti, Nicola ; Rebentrost, Patrick ; Wiebe, Nathan ; Lloyd, SethNature (London), 2017-09, Vol.549 (7671), p.195-202 [Periódico revisado por pares]England: Nature Publishing GroupTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
A Survey of Computation Offloading for Mobile SystemsKumar, Karthik ; Liu, Jibang ; Lu, Yung-Hsiang ; Bhargava, BharatMobile networks and applications, 2013-02, Vol.18 (1), p.129-140 [Periódico revisado por pares]Boston: Springer USTexto completo disponível |