首页 > 最新文献

Data Structures and Efficient Algorithms最新文献

英文 中文
Resemblance and Symmetries of Geometric Patterns 几何图案的相似性和对称性
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_19
H. Alt, Johannes Blömer
{"title":"Resemblance and Symmetries of Geometric Patterns","authors":"H. Alt, Johannes Blömer","doi":"10.1007/3-540-55488-2_19","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_19","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135907","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
High Performance Universal Hashing, with Applications to Shared Memory Simulations 高性能通用散列,与应用程序共享内存模拟
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_31
Martin Dietzfelbinger, F. Heide
{"title":"High Performance Universal Hashing, with Applications to Shared Memory Simulations","authors":"Martin Dietzfelbinger, F. Heide","doi":"10.1007/3-540-55488-2_31","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_31","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478122","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}
引用次数: 8
Selected Topics from Computational Geometry, Data Structures and Motion Planning 从计算几何,数据结构和运动规划选择主题
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_20
R. Fleischer, O. Fries, K. Mehlhorn, S. Meiser, S. Näher, H. Rohnert, S. Schirra, K. Simon, A. Tsakalidis, Christian Uhrig
{"title":"Selected Topics from Computational Geometry, Data Structures and Motion Planning","authors":"R. Fleischer, O. Fries, K. Mehlhorn, S. Meiser, S. Näher, H. Rohnert, S. Schirra, K. Simon, A. Tsakalidis, Christian Uhrig","doi":"10.1007/3-540-55488-2_20","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_20","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116825629","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
Enumerative vs. Genetic Optimization: Two Parallel Algorithms for the Bin Packing Problem 枚举优化与遗传优化:两种并行的装箱问题算法
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_35
B. Kröger, O. Vornberger
{"title":"Enumerative vs. Genetic Optimization: Two Parallel Algorithms for the Bin Packing Problem","authors":"B. Kröger, O. Vornberger","doi":"10.1007/3-540-55488-2_35","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_35","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127072084","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}
引用次数: 4
Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Buffer 基于宽度优先光线追踪和射线- z缓冲的分布式图像合成
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_25
H. Müller, Jörg Winckler
{"title":"Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Buffer","authors":"H. Müller, Jörg Winckler","doi":"10.1007/3-540-55488-2_25","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_25","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131928686","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}
引用次数: 4
Area Efficient Methods to Increase the Reliability of Circuits 提高电路可靠性的面积效率方法
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_36
R. Reischuk, Bernd Schmeltz
{"title":"Area Efficient Methods to Increase the Reliability of Circuits","authors":"R. Reischuk, Bernd Schmeltz","doi":"10.1007/3-540-55488-2_36","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_36","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131532545","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
A Flexible and Extensible Index Manager for Spatial Database Systems 空间数据库系统的灵活可扩展索引管理器
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_23
H. Kriegel, P. Heep, Stephan Heep, Michael Schiwietz, R. Schneider
{"title":"A Flexible and Extensible Index Manager for Spatial Database Systems","authors":"H. Kriegel, P. Heep, Stephan Heep, Michael Schiwietz, R. Schneider","doi":"10.1007/3-540-55488-2_23","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_23","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127333477","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}
引用次数: 8
Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects 单调平分*树-一个工具的有效划分复杂场景的几何对象
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_27
H. Noltemeier, K. Verbarg, C. Zirkelbach
{"title":"Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects","authors":"H. Noltemeier, K. Verbarg, C. Zirkelbach","doi":"10.1007/3-540-55488-2_27","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_27","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765801","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}
引用次数: 57
On Spanning Trees with Low Crossing Numbers 关于低交叉数生成树
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_30
E. Welzl
{"title":"On Spanning Trees with Low Crossing Numbers","authors":"E. Welzl","doi":"10.1007/3-540-55488-2_30","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_30","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133977981","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}
引用次数: 68
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques pram上布尔函数的复杂度——下界技术
Pub Date : 1900-01-01 DOI: 10.1007/3-540-55488-2_34
Mirosław Kutyłowski
{"title":"Complexity of Boolean Functions on PRAMs - Lower Bound Techniques","authors":"Mirosław Kutyłowski","doi":"10.1007/3-540-55488-2_34","DOIUrl":"https://doi.org/10.1007/3-540-55488-2_34","url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132485045","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
期刊
Data Structures and Efficient Algorithms
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1