cc.\*:("001D02A01")
Results 1 to 25 of 768
Selection :
A unified approach to coding labeled treesCAMINITI, Saverio; FINOCCHI, Irene; PETRESCHI, Rossella et al.Lecture notes in computer science. 2004, pp 339-348, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper
Designing small keyboards is hardCARDINAL, Jean; LANGERMAN, Stefan.Lecture notes in computer science. 2004, pp 391-400, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper
Complexity of cycle length modularity problems in graphsHEMASPAANDRA, Edith; SPAKOWSKI, Holger; THAKUR, Mayur et al.Lecture notes in computer science. 2004, pp 509-518, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper
Approximating the expressive power of logics in finite modelsARRATIA, Argimiro; ORTIZ, Carlos E.Lecture notes in computer science. 2004, pp 540-556, issn 0302-9743, isbn 3-540-21258-2, 17 p.Conference Paper
A constant approximation algorithm for sorting buffersKOHRT, Jens S; PRUHS, Kirk.Lecture notes in computer science. 2004, pp 193-202, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper
Constant width planar computation characterizes ACC0HANSEN, Kristoffer Arnsfelt.Lecture notes in computer science. 2004, pp 44-55, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
A measured collapse of the modal μ-calculus alternation hierarchyBUSTAN, Doron; KUPFERMAN, Orna; VARDIL, Moshe Y et al.Lecture notes in computer science. 2004, pp 522-533, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
Effective strong dimension in algorithmic information and computational complexityATHREYA, Krishna B; HITCHCOCK, John M; LUTZ, Jack H et al.Lecture notes in computer science. 2004, pp 632-643, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
Some results on directable automataITO, Masami; SHIKISHIMA-TSUJI, Kayoko.Theory is forever : essays dedicated to Arto Salomaa on the occasion of this 70th birthday. Lecture notes in computer science. 2004, pp 125-133, issn 0302-9743, isbn 3-540-22393-2, 9 p.Book Chapter
Recombination systemsKOIVISTO, Mikko; RASTAS, Pasi; UKKONEN, Esko et al.Theory is forever : essays dedicated to Arto Salomaa on the occasion of this 70th birthday. Lecture notes in computer science. 2004, pp 159-169, issn 0302-9743, isbn 3-540-22393-2, 11 p.Book Chapter
FSTTCS 2004 : foundations of software technology and theoretical computer science (Chennai, 16-18 December 2004)Lodaya, Kamal; Mahajan, Meena.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24058-6, XVI, 532 p, isbn 3-540-24058-6Conference Proceedings
Learning languages from positive data and a finite number of queriesJAIN, Sanjay; KINBER, Efim.Lecture notes in computer science. 2004, pp 360-371, issn 0302-9743, isbn 3-540-24058-6, 12 p.Conference Paper
Decidability of zenoness, syntactic boundedness and token-liveness for dense-Timed Petri NetsABDULLA, Parosh; MAHATA, Pritha; MAYR, Richard et al.Lecture notes in computer science. 2004, pp 58-70, issn 0302-9743, isbn 3-540-24058-6, 13 p.Conference Paper
Alternation in equational tree automata modulo XORKUMAR NEERAJ VERMA.Lecture notes in computer science. 2004, pp 518-530, issn 0302-9743, isbn 3-540-24058-6, 13 p.Conference Paper
Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open termsBALA, Sebastian.Lecture notes in computer science. 2004, pp 596-607, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
Separating codes: Constructions and boundsCOHEN, Gérard; SCHAATHUN, Hans Georg.Lecture notes in computer science. 2004, pp 322-328, issn 0302-9743, isbn 3-540-21258-2, 7 p.Conference Paper
The complexity of Boolean constraint isomorphismBÖHLER, Elmar; HEMASPAANDRA, Edith; REITH, Steffen et al.Lecture notes in computer science. 2004, pp 164-175, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
The complexity of finding top-toda-equivalence-class membersHEMASPAANDRA, Lane A; OGIHARA, Mitsunori; ZAKI, Mohammed J et al.Lecture notes in computer science. 2004, pp 90-99, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper
The expected competitive ratio for weighted completion time schedulingSOUZA, Alexander; STEGER, Angelika.Lecture notes in computer science. 2004, pp 620-631, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper
Computer science in perspective (essays dedicated to Thomas Ottmann)Ottmann, Thomas; Klein, Rolf; Six, Hans-Werner et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-00579-X, X, 357 p, isbn 3-540-00579-XBook
MFCS 2003 : mathematical foundations of computer science 2003 (Bratislava, 25-29 August 2003)Rovan, Branislav; Vojtas, Peter.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40671-9, XIII, 680 p, isbn 3-540-40671-9Conference Proceedings
A coalgebraic description of web interactionsCANCILA, Daniela; HONSELL, Furio.Lecture notes in computer science. 2003, pp 271-283, issn 0302-9743, isbn 3-540-20216-1, 13 p.Conference Paper
1-bounded TWA cannot be determinizedBOJANCZYK, Mikołaj.Lecture notes in computer science. 2003, pp 62-73, issn 0302-9743, isbn 3-540-20680-9, 12 p.Conference Paper
The fidelity of annealing-ligation : A theoretical analysisROSE, John A; DEATON, Russell J.Lecture notes in computer science. 2001, pp 231-246, issn 0302-9743, isbn 3-540-42076-2Conference Paper
New challenges for Theoretical Computer Science: (General introduction to the panel)GRUSKA, J.Lecture notes in computer science. 2000, pp 599-601, issn 0302-9743, isbn 3-540-67823-9Conference Paper
