المؤلفون: Fischer, Orr, Oshman, Rotem, Shamir, Dana

مصطلحات موضوعية: proof-labeling schemes, space-time tradeoffs, families with excluded minor, Networks, Theory of computation → Distributed algorithms

وصف الملف: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.OPODIS.2021

الاتاحة: https://dx.doi.org/10.4230/lipics.opodis.2021.21
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.21

المؤلفون: Flores-Velazco, Alejandro, Mount, David M.

المساهمون: Alejandro Flores-Velazco and David M. Mount

مصطلحات موضوعية: approximate nearest-neighbor searching, nearest-neighbor classification, geometric data structures, space-time tradeoffs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.44

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2021.44
https://nbn-resolving.org/urn:nbn:de:0030-drops-146252
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.44

المؤلفون: Laurent Feuilloley (Universidad de Chile), Pierre Fraigniaud (IRIF, CNRS, Université de Paris), Juho Hirvonen (Aalto University), Ami Paz (Faculty of Computer Science, University of Vienna), Mor Perry (Weizmann Institute of Science)

المصدر: Distributed Computing ; issn:0178-2770

مصطلحات موضوعية: Distributed verification, Distributed graph algorithms, Proof-labeling schemes, Space-time tradeoffs, Nondeterminism

وصف الملف: application/pdf

Relation: isPartOf:https://phaidra.univie.ac.at/o:243553[u:scholar collection]; hdl:11353/10.1218541; https://phaidra.univie.ac.at/o:1218541

الاتاحة: https://doi.org/10.1007/s00446-020-00386-z
https://phaidra.univie.ac.at/o:1218541

المؤلفون: Feuilloley, Laurent, Fraigniaud, Pierre, Hirvonen, Juho, Paz, Ami, Perry, Mor

المساهمون: Laurent Feuilloley and Pierre Fraigniaud and Juho Hirvonen and Ami Paz and Mor Perry

مصطلحات موضوعية: Distributed verification, Distributed graph algorithms, Proof-labeling schemes, Space-time tradeoffs, Non-determinism

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.24

الاتاحة: https://doi.org/10.4230/LIPIcs.DISC.2018.24
https://nbn-resolving.org/urn:nbn:de:0030-drops-98139
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.24

المؤلفون: 小長谷, 松雄

مصطلحات موضوعية: Computational geometry, Algorithms, Memory constrained algorithms, Space-Time tradeoffs

وصف الملف: application/pdf

URL الوصول: https://ndlsearch.ndl.go.jp/books/R100000039-I10200950

Degree: 博士（情報科学） -- 北陸先端科学技術大学院大学

المؤلفون: I, Tomohiro, Kärkkäinen, Juha, Kempa, Dominik

المساهمون: Tomohiro I and Juha Kärkkäinen and Dominik Kempa

مصطلحات موضوعية: string algorithms, sparse suffix sorting, sparse suffix trees, Karp-Rabin fingerprints, space-time tradeoffs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.386

الاتاحة: https://doi.org/10.4230/LIPIcs.STACS.2014.386
https://nbn-resolving.org/urn:nbn:de:0030-drops-44738
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.386

المؤلفون: Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.cs.ucsc.edu/~optas/papers/nnjag.pdf.

مصطلحات موضوعية: Key words. lower bounds, space–time tradeoffs, space complexity, connectivity

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7147; http://www.cs.ucsc.edu/~optas/papers/nnjag.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7147
http://www.cs.ucsc.edu/~optas/papers/nnjag.pdf

المؤلفون: Austrin, Per, Kaski, P., Koivisto, M., Määttä, J.

المصدر: Automata, Languages, and Programming Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). :45-56

مصطلحات موضوعية: Random composites, Randomness property, Space usage, Space-time tradeoffs, Subset sum, Subset sum problems, Trade space

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134078

مصطلحات موضوعية: Memory constrained algorithms, ComputingMilieux_THECOMPUTINGPROFESSION, Space-Time tradeoffs, ComputerApplications_COMPUTERSINOTHERSYSTEMS, Computational geometry, Algorithms

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=jairo_______::5224802556b7d1ef78b776e269923f4d
http://hdl.handle.net/10119/13719

المؤلفون: Simon Puglisi, Andrew Turpin

مصطلحات موضوعية: Information systems not elsewhere classified, Theory of computation not elsewhere classified, Algorithms, Automobile seats, Bioinformatics, Data compression, Data structures, External memories, Indexing (of information), Memory overheads, New algorithm, Parallel processing systems, Pattern matching, Space-time tradeoffs, String processing, Suffix arrays, Suffix trees, Time algorithms, Trees (mathematics), Working memory (WM), Working space, strings, text indexing

Relation: 10779/rmit.27363789.v1

الاتاحة: https://figshare.com/articles/conference_contribution/Space-time_tradeoffs_for_longest-common-prefix_array_computation/27363789

المؤلفون: Arya, Sunil CSE, Da fonseca, G.D., Mount, D.M.

مصطلحات موضوعية: Nearest neighbor searching, Polytope membership, Space-time tradeoffs

Relation: http://repository.ust.hk/ir/Record/1783.1-44256; STOC '11, Proceedings of the 43rd annual ACM Symposium on Theory of Computing, v. 2011, Jun, p. 579-586; https://doi.org/10.1145/1993636.1993713; http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0097-5397&rft.volume=v. 47&rft.issue=(1)&rft.date=2018&rft.spage=1&rft.aulast=Arya&rft.aufirst=Sunil&rft.atitle=APPROXIMATE+POLYTOPE+MEMBERSHIP+QUERIES&rft.title=SIAM+JOURNAL+ON+COMPUTING; http://www.scopus.com/record/display.url?eid=2-s2.0-79959702334&origin=inward; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000297656800060

الاتاحة: http://repository.ust.hk/ir/Record/1783.1-44256
https://doi.org/10.1145/1993636.1993713
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0097-5397&rft.volume=v. 47&rft.issue=(1)&rft.date=2018&rft.spage=1&rft.aulast=Arya&rft.aufirst=Sunil&rft.atitle=APPROXIMATE+POLYTOPE+MEMBERSHIP+QUERIES&rft.title=SIAM+JOURNAL+ON+COMPUTING
http://www.scopus.com/record/display.url?eid=2-s2.0-79959702334&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000297656800060

المؤلفون: Arya, Sunil, Malamatos, Theocharis, Mount, David M.

مصطلحات موضوعية: Algorithms, Theory, Nearest neighbor searching, Space-time tradeoffs

Relation: http://repository.ust.hk/ir/Record/1783.1-28426; JOURNAL OF THE ACM, v. 57, (1), 2009, Nov, Article number 1; https://doi.org/10.1145/1613676.1613677; http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0004-5411&rft.volume=57&rft.issue=1&rft.date=2009&rft.spage=&rft.aulast=Arya&rft.aufirst=Sunil&rft.atitle=Space-Time+Tradeoffs+for+Approximate+Nearest+Neighbor+Searching; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000273339000001; http://www.scopus.com/record/display.url?eid=2-s2.0-71449106113&origin=inward

الاتاحة: http://repository.ust.hk/ir/Record/1783.1-28426
https://doi.org/10.1145/1613676.1613677
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0004-5411&rft.volume=57&rft.issue=1&rft.date=2009&rft.spage=&rft.aulast=Arya&rft.aufirst=Sunil&rft.atitle=Space-Time+Tradeoffs+for+Approximate+Nearest+Neighbor+Searching
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000273339000001
http://www.scopus.com/record/display.url?eid=2-s2.0-71449106113&origin=inward

المؤلفون: 小長谷, 松雄

المساهمون: こながや, まつお

مصطلحات موضوعية: Computational geometry, Algorithms, Memory constrained algorithms, Space-Time tradeoffs

وصف الملف: application/pdf

Relation: http://hdl.handle.net/10119/13719

الاتاحة: http://hdl.handle.net/10119/13719

المؤلفون: Tomohiro I and Juha Kärkkäinen and Dominik Kempa, I, Tomohiro, Kärkkäinen, Juha, Kempa, Dominik

مصطلحات الفهرس: string algorithms, sparse suffix sorting, sparse suffix trees, Karp-Rabin fingerprints, space-time tradeoffs, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.386
Is Part Of LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)