International Colloquium on Automata, Languages and Programming  - ICALP

领  域:  算法与理论
主  页:  http://www.comsoc.org/livepubs/surveys/index.html

论文统计图
相关事件


最新的论文更多>>
The Complexity of Proving That a Graph Is Ramsey  
Massimo Lauria , Pavel Pudlak , Vojtech Rodl , Neil Thapen
International Colloquium on Automata, Languages and Programming  2013
0次引用 0 0
Dual Techniques for Scheduling on a Machine with Varying Speed  
Nicole Megow , Jose Verschae
International Colloquium on Automata, Languages and Programming  2013
0次引用 0 0
Arthur-Merlin Streaming Complexity  
Tom Gur , Ran Raz
International Colloquium on Automata, Languages and Programming  2013
0次引用 0 0
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions  
Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Kazuhisa Makino
International Colloquium on Automata, Languages and Programming  2013
0次引用 0 0
Silent Transitions in Automata with Storage  
Georg Zetzsche
International Colloquium on Automata, Languages and Programming  2013
0次引用 0 0
 录用率: 参会人数: 影响力:
投稿方向:
会议点评
还没有人点评哦
主要作者
Kurt Mehlhorn
MPI for Informatics, Saarbrücken, Germany
 
Paul G. Spirakis
Computer Technology Institute and Press "Diophantus", Patras, Greece,University of Patras, Patras, Greece
 
Amir Pnueli
Weizmann Institute of Science
 
Jean-eric Pin
UMR7089 Laboratoire d'Informatique Algorithmique: Fondements et Applications
 
Juhani Karhumaki
University of Turku
 
主要概念
Feedback
Feedback
Feedback
我想反馈:
排行榜