Journals in DBLP

Inf. Process. Lett.
2002, volume: 84, number: 6

1. Daniel Kirsten
   The finite power problem revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:291-294 [Journal]
   
2. Prasanta K. Jana, B. Damodara Naidu, Shailendra Kumar, Manish Arora, Bhabani P. Sinha
   Parallel prefix computation on extended multi-mesh network. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:295-303 [Journal]
   
3. Andrea Maggiolo-Schettini, Simone Tini
   On disjunction of literals in triggers of statecharts transitions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:305-310 [Journal]
   
4. Antoni Diller
   Efficient multi-variate abstraction using an array representation for combinators. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:311-317 [Journal]
   
5. Carlo Blundo, Stelvio Cimato, Barbara Masucci
   A note on optimal metering schemes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:319-326 [Journal]
   
6. A. L. Rastsvetaev, Lev D. Beklemishev
   On the query complexity of finding a local maximum point. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:327-332 [Journal]
   
7. Sean Cleary
   Restricted rotation distance between binary trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:333-338 [Journal]
   
8. Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit
   Simulating finite automata with context-free grammars. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:84, n:6, pp:339-344 [Journal]