Jahrestagung der Gesellschaft für Informatik最新文献

筛选
英文 中文
Communication Complexity and Lower Bounds for Sequential Computation 序列计算的通信复杂度和下界
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_15
B. Kalyanasundaram, G. Schnitger
{"title":"Communication Complexity and Lower Bounds for Sequential Computation","authors":"B. Kalyanasundaram, G. Schnitger","doi":"10.1007/978-3-322-95233-2_15","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_15","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"7 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":"127297518","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
Transductions and context-free languages 转导和上下文无关的语言
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-663-09367-1
J. Berstel
{"title":"Transductions and context-free languages","authors":"J. Berstel","doi":"10.1007/978-3-663-09367-1","DOIUrl":"https://doi.org/10.1007/978-3-663-09367-1","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"1 4 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":"130263586","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}
引用次数: 1348
Complexity Measures on Permutations 排列的复杂性度量
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_6
V. Claus
{"title":"Complexity Measures on Permutations","authors":"V. Claus","doi":"10.1007/978-3-322-95233-2_6","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_6","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"25 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":"133860619","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}
引用次数: 1
Zur Beherrschbarkeit des Entwicklungsprozesses komplexer Software-Systeme 确保复杂软件系统的开发
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_28
W. Stucky, A. Oberweis
{"title":"Zur Beherrschbarkeit des Entwicklungsprozesses komplexer Software-Systeme","authors":"W. Stucky, A. Oberweis","doi":"10.1007/978-3-322-95233-2_28","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_28","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"51 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003275","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
Eine O(e log e) - Heuristik für ein Flußproblem 河道问题的河床检验
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_20
H. Osthof
{"title":"Eine O(e log e) - Heuristik für ein Flußproblem","authors":"H. Osthof","doi":"10.1007/978-3-322-95233-2_20","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_20","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"53 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":"122952577","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
TPNA: Ein neues Analyseverfahren für Tandem-Prioritäten-Netze 塔布娜:关于tandem网络的新分析
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_25
O. Spaniol, W. Kremer, A. Fasbender
{"title":"TPNA: Ein neues Analyseverfahren für Tandem-Prioritäten-Netze","authors":"O. Spaniol, W. Kremer, A. Fasbender","doi":"10.1007/978-3-322-95233-2_25","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_25","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"10 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":"127993395","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
Verteilung der Nullstellen von Polynomen auf Jordanbögen 约旦河谷近零点分布
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_4
H. Blatt
{"title":"Verteilung der Nullstellen von Polynomen auf Jordanbögen","authors":"H. Blatt","doi":"10.1007/978-3-322-95233-2_4","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_4","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"55 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":"131588080","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}
引用次数: 1
Distributed Class Group Computation 分布式类群计算
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_5
J. Buchmann, S. Düllmann
{"title":"Distributed Class Group Computation","authors":"J. Buchmann, S. Düllmann","doi":"10.1007/978-3-322-95233-2_5","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_5","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"68 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":"132701678","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
Dynamic Hashing in Real Time 实时动态哈希
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_7
Martin Dietzfelbinger, F. Heide
{"title":"Dynamic Hashing in Real Time","authors":"Martin Dietzfelbinger, F. Heide","doi":"10.1007/978-3-322-95233-2_7","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_7","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"30 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":"126490890","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}
引用次数: 35
Baumautomaten zur Codeselektion 树拨机来进行密码选择
Jahrestagung der Gesellschaft für Informatik Pub Date : 1900-01-01 DOI: 10.1007/978-3-322-95233-2_8
Christian Ferdinand, H. Seidl, R. Wilhelm
{"title":"Baumautomaten zur Codeselektion","authors":"Christian Ferdinand, H. Seidl, R. Wilhelm","doi":"10.1007/978-3-322-95233-2_8","DOIUrl":"https://doi.org/10.1007/978-3-322-95233-2_8","url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"354 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":"122853258","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学术官方微信