发布求助
文献互助 智能选刊 最新文献

International Workshop Randomization and Approximation Techniques in Computer Science最新文献

筛选
英文 中文
Counting Distinct Elements in a Data Stream 统计数据流中的不同元素
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_1
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, L. Trevisan
{"title":"Counting Distinct Elements in a Data Stream","authors":"Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, L. Trevisan","doi":"10.1007/3-540-45726-7_1","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_1","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116933962","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}
引用次数: 532
Bisection of Random Cubic Graphs 随机三次图的二分法
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_10
J. Díaz, N. Do, M. Serna, N. Wormald
{"title":"Bisection of Random Cubic Graphs","authors":"J. Díaz, N. Do, M. Serna, N. Wormald","doi":"10.1007/3-540-45726-7_10","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_10","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116751830","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}
引用次数: 5
Computing Graph Properties by Randomized Subcube Partitions 通过随机子立方体分区计算图属性
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_9
E. Friedgut, J. Kahn, A. Wigderson
{"title":"Computing Graph Properties by Randomized Subcube Partitions","authors":"E. Friedgut, J. Kahn, A. Wigderson","doi":"10.1007/3-540-45726-7_9","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_9","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114839115","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}
引用次数: 23
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications 保留体积和距离到仿射空间的降维及其算法应用
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_19
A. Magen
{"title":"Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications","authors":"A. Magen","doi":"10.1007/3-540-45726-7_19","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_19","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122193531","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}
引用次数: 80
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes 2-查询局部可解码线性码的最优下界
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_4
K. Obata
{"title":"Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes","authors":"K. Obata","doi":"10.1007/3-540-45726-7_4","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_4","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131786951","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}
引用次数: 49
Randomness-Optimal Characterization of Two NP Proof Systems 两个NP证明系统的随机最优表征
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_15
A. D. Santis, G. D. Crescenzo, G. Persiano
{"title":"Randomness-Optimal Characterization of Two NP Proof Systems","authors":"A. D. Santis, G. D. Crescenzo, G. Persiano","doi":"10.1007/3-540-45726-7_15","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_15","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122702896","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}
引用次数: 19
On the 2-Colorability of Random Hypergraphs 关于随机超图的2-可色性
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_7
D. Achlioptas, Cristopher Moore
{"title":"On the 2-Colorability of Random Hypergraphs","authors":"D. Achlioptas, Cristopher Moore","doi":"10.1007/3-540-45726-7_7","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_7","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127103712","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}
引用次数: 27
On the Eigenvalue Power Law 关于特征值幂律
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_20
M. Mihail, C. Papadimitriou
{"title":"On the Eigenvalue Power Law","authors":"M. Mihail, C. Papadimitriou","doi":"10.1007/3-540-45726-7_20","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_20","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985367","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}
引用次数: 163
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms “轻微非均匀”算法的概率-时间层次定理
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_16
B. Barak
{"title":"A Probabilistic-Time Hierarchy Theorem for \"Slightly Non-uniform\" Algorithms","authors":"B. Barak","doi":"10.1007/3-540-45726-7_16","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_16","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116537459","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}
引用次数: 72
Finding Sparse Induced Subgraphs of Semirandom Graphs 寻找半随机图的稀疏诱导子图
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_12
A. Coja-Oghlan
{"title":"Finding Sparse Induced Subgraphs of Semirandom Graphs","authors":"A. Coja-Oghlan","doi":"10.1007/3-540-45726-7_12","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_12","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133447022","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}
引用次数: 5
下一页 尾页
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学术官方微信