Result 1 to 20 of 35 total
Unary coded NP-complete languages in ASPACE($\log \log n$). (English)
Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 166-177 (2012).
1
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. (English)
Theor. Comput. Sci. 412, No. 4-5, 458-477 (2011).
2
Black hole search in directed graphs. (English)
Kutten, Shay (ed.) et al., Structural information and communication complexity. 16th international colloquium, SIROCCO 2009, Piran, Slovenia, May 25‒27, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11475-5/pbk). Lecture Notes in Computer Science 5869, 182-194 (2010).
3
Proceedings of the conference on theory and practice of information technologies, ITAT 2010, hotel smrekovica, veľká fatra, Slovak Republic, September 21-25, 2010 (English)
CEUR Workshop Proceedings: ITAT 683 (2010).
4
Measuring the problem-relevant information in input. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 585-613 (2009).
5
Parallel communicating grammar systems with regular control. (English)
Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Third international conference, CAI 2009, Thessaloniki, Greece, May 19‒22, 2009, Proceedings. Berlin: Springer (ISBN 978-3-642-03563-0/pbk). Lecture Notes in Computer Science 5725, 342-360 (2009).
6
Measuring the problem-relevant information in input. (English)
Theor. Inform. Appl. 43, No. 3, 585-613 (2009).
7
On parallel communicating grammar systems and correctness preserving restarting automata. (English)
Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2‒8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 660-671 (2009).
8
Factoring and testing primes in small space. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 291-302 (2009).
9
Antibandwidth and cyclic antibandwidth of Hamming graphs (English)
Electronic Notes in Discrete Mathematics 34, 295-300 (2009).
10
Parallel communicating grammar systems with regular control (English)
CAI, 342-360 (2009).
11
On parallel communicating grammar systems and correctness preserving restarting automata (English)
LATA, 660-671 (2009).
12
Black hole search in directed graphs (English)
SIROCCO, 182-194 (2009).
13
Factoring and testing primes in small space (English)
SOFSEM, 291-302 (2009).
14
Leader election in extremely unreliable rings and complete networks. (English)
Baker, Theodore P. (ed.) et al., Principles of distributed systems. 12th international conference, OPODIS 2008, Luxor, Egypt, December 15‒18, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92220-9/pbk). Lecture Notes in Computer Science 5401, 512-526 (2008).
15
Wireless mobile computing and its links to descriptive complexity. (English)
Int. J. Found. Comput. Sci. 19, No. 4, 887-913 (2008).
16
On the power of broadcasting in mobile computing. (English)
Cooper, S. Barry (ed.) et al., New computational paradigms. Changing conceptions of what is computable. New York, NY: Springer (ISBN 978-0-387-36033-1/hbk). 195-209 (2008).
17
How much information about the future is needed? (English)
Geffert, Viliam (ed.) et al., SOFSEM 2008: Theory and practice of computer science. 34th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 19‒25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77565-2/pbk). Lecture Notes in Computer Science 4910, 247-258 (2008).
18
Leader election in extremely unreliable rings and complete networks (English)
OPODIS, 512-526 (2008).
19
How much information about the future is needed? (English)
SOFSEM, 247-258 (2008).
20
Result 1 to 20 of 35 total