Fun with Algorithms最新文献

筛选
英文 中文
Bit-(Parallelism)2: Getting to the Next Level of Parallelism 位(并行)2:进入下一个并行级别
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_18
Domenico Cantone, S. Faro, Emanuele Giaquinta
{"title":"Bit-(Parallelism)2: Getting to the Next Level of Parallelism","authors":"Domenico Cantone, S. Faro, Emanuele Giaquinta","doi":"10.1007/978-3-642-13122-6_18","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_18","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131261904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
The FUNnest Talks That belong to FUN (Abstract) 属于FUN的最有趣的谈话(摘要)
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_2
P. Raghavan
{"title":"The FUNnest Talks That belong to FUN (Abstract)","authors":"P. Raghavan","doi":"10.1007/978-3-642-13122-6_2","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_2","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 在桌子安排,拼字怪胎,和混乱的模式匹配
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_11
P. Burcsi, F. Cicalese, G. Fici, Z. Lipták
{"title":"On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching","authors":"P. Burcsi, F. Cicalese, G. Fici, Z. Lipták","doi":"10.1007/978-3-642-13122-6_11","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_11","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121572177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
A Better Bouncer's Algorithm 一个更好的保镖算法
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_13
F. Cicalese, T. Gagie, A. Macula, Martin Milanič, E. Triesch
{"title":"A Better Bouncer's Algorithm","authors":"F. Cicalese, T. Gagie, A. Macula, Martin Milanič, E. Triesch","doi":"10.1007/978-3-642-13122-6_13","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_13","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"309 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132068040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List 单链表中前缀反转的O(1)时间反排序
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_35
A. Williams
{"title":"O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List","authors":"A. Williams","doi":"10.1007/978-3-642-13122-6_35","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_35","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116007441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Managing Change in the Era of the iPhone iPhone时代的管理变革
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_25
P. Healy
{"title":"Managing Change in the Era of the iPhone","authors":"P. Healy","doi":"10.1007/978-3-642-13122-6_25","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_25","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131491717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fun with Olympiad in Algorithmics 有趣的奥林匹克算法
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_1
R. Grossi, Alessio Orlandi, G. Ottaviano
{"title":"Fun with Olympiad in Algorithmics","authors":"R. Grossi, Alessio Orlandi, G. Ottaviano","doi":"10.1007/978-3-642-13122-6_1","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_1","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125687245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Magic of a Number System 数字系统的魔力
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_17
Amr Elmasry, Claus Jensen, J. Katajainen
{"title":"The Magic of a Number System","authors":"Amr Elmasry, Claus Jensen, J. Katajainen","doi":"10.1007/978-3-642-13122-6_17","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_17","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121940290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram 密码学和物理零知识证明:从数独到非数字
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_12
Yu-Feng Chien, W. Hon
{"title":"Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram","authors":"Yu-Feng Chien, W. Hon","doi":"10.1007/978-3-642-13122-6_12","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_12","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128348164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Using Cell Phone Keyboards Is (NPmathcal{NP}) Hard 使用手机键盘是(NPmathcal{NP})困难
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_8
Peter Boothe
{"title":"Using Cell Phone Keyboards Is (NPmathcal{NP}) Hard","authors":"Peter Boothe","doi":"10.1007/978-3-642-13122-6_8","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_8","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131490981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信