The SCEAS System
Navigation Menu

Search the dblp DataBase


Csanád Imreh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
    Buying a Constant Competitive Ratio for Paging. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:98-108 [Conf]
  2. Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger
    The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:862-874 [Conf]
  3. Leah Epstein, Csanád Imreh, Rob van Stee
    More on Weighted Servers or FIFO is Better than LRU. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:257-268 [Conf]
  4. Csanád Imreh, John Noga
    Scheduling with Machine Cost. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:168-176 [Conf]
  5. Csanád Imreh
    An online scheduling algorithm for a two-layer multiprocessor architecture. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2001, v:15, n:2, pp:- [Journal]
  6. Balázs Imreh, Csanád Imreh, Masami Ito
    On directable nondeterministic trapped automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2003, v:16, n:1, pp:37-45 [Journal]
  7. Cs. Holló, Z. Blázsik, Csanád Imreh, Z. Kovacs
    On Merging Reduction of the Process Network Synthesis Problem. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1999, v:14, n:2, pp:251-262 [Journal]
  8. Csanád Imreh
    A New Well-Solvable Class of PNS Problems. [Citation Graph (0, 0)][DBLP]
    Computing, 2001, v:66, n:3, pp:289-296 [Journal]
  9. Csanád Imreh
    Scheduling Problems on Two Sets of Identical Machines. [Citation Graph (0, 0)][DBLP]
    Computing, 2003, v:70, n:4, pp:277-294 [Journal]
  10. Balázs Imreh, Csanád Imreh, Masami Ito
    On Monotonic Directable Nondeterministic Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:3, pp:539-547 [Journal]
  11. Csanád Imreh
    Online strip packing with modifiable boxes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:79-85 [Journal]
  12. Leah Epstein, Csanád Imreh, Rob van Stee
    More on weighted servers or FIFO is better than LRU. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:305-317 [Journal]
  13. Csanád Imreh, Tamás Németh
    On Time Lookahead Algorithms for the Online Data Acknowledgement Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:288-297 [Conf]

  14. Online Clustering with Variable Sized Clusters. [Citation Graph (, )][DBLP]

  15. On Monogenic Nondeterministic Automata. [Citation Graph (, )][DBLP]

  16. Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection. [Citation Graph (, )][DBLP]

  17. Online scheduling with machine cost and rejection. [Citation Graph (, )][DBLP]

  18. Online scheduling with general machine cost functions. [Citation Graph (, )][DBLP]

  19. On the sum minimization version of the online bin covering problem. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002