Fun with Algorithms最新文献

筛选
英文 中文
Playing Dominoes Is Hard, Except by Yourself 玩多米诺骨牌很难,除非你自己
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_12
E. Demaine, Fermi Ma, Erik Waingarten
{"title":"Playing Dominoes Is Hard, Except by Yourself","authors":"E. Demaine, Fermi Ma, Erik Waingarten","doi":"10.1007/978-3-319-07890-8_12","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_12","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765332","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}
引用次数: 3
Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract) 打扰一下!或礼貌的戏剧观众的问题-(扩展摘要)
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_17
Konstantinos Georgiou, E. Kranakis, D. Krizanc
{"title":"Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract)","authors":"Konstantinos Georgiou, E. Kranakis, D. Krizanc","doi":"10.1007/978-3-319-07890-8_17","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_17","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129369149","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 Harassed Waitress Problem 被骚扰的服务员问题
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_28
Harrah Essed, Wei Therese
{"title":"The Harassed Waitress Problem","authors":"Harrah Essed, Wei Therese","doi":"10.1007/978-3-319-07890-8_28","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_28","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133457732","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}
引用次数: 3
Clearing Connections by Few Agents 通过少数代理清除连接
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_25
C. Levcopoulos, A. Lingas, Bengt J. Nilsson, P. Żyliński
{"title":"Clearing Connections by Few Agents","authors":"C. Levcopoulos, A. Lingas, Bengt J. Nilsson, P. Żyliński","doi":"10.1007/978-3-319-07890-8_25","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_25","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114082138","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}
引用次数: 2
Finding Centers and Medians of a Tree by Distance Queries 通过距离查询查找树的中心和中位数
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_30
B. Wu
{"title":"Finding Centers and Medians of a Tree by Distance Queries","authors":"B. Wu","doi":"10.1007/978-3-319-07890-8_30","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_30","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122342382","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
Secure Auctions without Cryptography 没有加密的安全拍卖
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_14
Jannik Dreier, H. Jonker, P. Lafourcade
{"title":"Secure Auctions without Cryptography","authors":"Jannik Dreier, H. Jonker, P. Lafourcade","doi":"10.1007/978-3-319-07890-8_14","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_14","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123421867","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}
引用次数: 6
Competitive Analysis of the Windfall Game 横财游戏的竞争分析
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_16
R. Fleischer, Zhang Tao
{"title":"Competitive Analysis of the Windfall Game","authors":"R. Fleischer, Zhang Tao","doi":"10.1007/978-3-319-07890-8_16","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_16","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126017874","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
No Easy Puzzles: A Hardness Result for Jigsaw Puzzles 没有简单的拼图:拼图的硬度结果
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_6
M. Brand
{"title":"No Easy Puzzles: A Hardness Result for Jigsaw Puzzles","authors":"M. Brand","doi":"10.1007/978-3-319-07890-8_6","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_6","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131994077","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
Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives 僵尸群:调查你的亡灵亲戚的行为
Fun with Algorithms Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07890-8_18
V. Gervasi, G. Prencipe, Valerio Volpi
{"title":"Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives","authors":"V. Gervasi, G. Prencipe, Valerio Volpi","doi":"10.1007/978-3-319-07890-8_18","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_18","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129415000","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
Normal, Abby Normal, Prefix Normal 正常,艾比正常,前缀正常
Fun with Algorithms Pub Date : 2014-04-01 DOI: 10.1007/978-3-319-07890-8_7
P. Burcsi, G. Fici, Z. Lipták, F. Ruskey, J. Sawada
{"title":"Normal, Abby Normal, Prefix Normal","authors":"P. Burcsi, G. Fici, Z. Lipták, F. Ruskey, J. Sawada","doi":"10.1007/978-3-319-07890-8_7","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_7","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129937813","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}
引用次数: 9
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学术官方微信