Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrei Negoescu

Andrei Laurian Negoescu

> Home > Persons

Person information

affiliation: Goethe University Frankfurt am Main, Institute for Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2015
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/KovacsMMN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/KovacsMMN15
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115(12): 932-938 (2015)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/BrodalMN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BrodalMN15
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56(1): 22-40 (2015)
2014
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jea/MoruzNNW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/MoruzNNW14
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. ACM J. Exp. Algorithmics 19(1) (2014)
2013
[b1]
- view
  authority control:
- export record
  dblp key:
  - phd/dnb/Negoescu13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Negoescu13
Andrei Laurian Negoescu:
Design of competitive paging algorithms with good behaviour in practice. Goethe University Frankfurt am Main, 2013, pp. 1-145
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/MoruzN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/MoruzN13
Gabriel Moruz, Andrei Negoescu:
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. ICALP (1) 2013: 757-768
2012
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/MoruzN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/MoruzN12
Gabriel Moruz, Andrei Negoescu:
Outperforming LRU via competitive analysis on parametrized inputs for paging. SODA 2012: 1669-1680
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/wea/MoruzNNW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/MoruzNNW12
Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. SEA 2012: 320-331
2011
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/tapas/MeyerNW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tapas/MeyerNW11
Ulrich Meyer, Andrei Negoescu, Volker Weichert:
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. TAPAS 2011: 217-228
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/waoa/BrodalMN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/BrodalMN11
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA 2011: 164-175

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2009
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/KovacsMN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/KovacsMN09
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
Online paging for flash memory devices. ISAAC 2009: 352-361

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.