Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Eduardo Quiñones

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Emery D. Berger

> Home > Persons > Eduardo Quiñones

Publications

2013
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/tecs/CazorlaQVCTBBAWHSKLM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tecs/CazorlaQVCTBBAWHSKLM13
Francisco J. Cazorla, Eduardo Quiñones, Tullio Vardanega, Liliana Cucu, Benoit Triquet, Guillem Bernat, Emery D. Berger, Jaume Abella, Franck Wartel, Michael Houston, Luca Santinelli, Leonidas Kosmidis, Code Lo, Dorin Maxim:
PROARTIS: Probabilistically Analyzable Real-Time Systems. ACM Trans. Embed. Comput. Syst. 12(2s): 94:1-94:26 (2013)
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/date/KosmidisCQABC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/KosmidisCQABC13
Leonidas Kosmidis, Charlie Curtsinger, Eduardo Quiñones, Jaume Abella, Emery D. Berger, Francisco J. Cazorla:
Probabilistic timing analysis on conventional cache designs. DATE 2013: 603-606
2009
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/ecrts/QuinonesBBC09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecrts/QuinonesBBC09
Eduardo Quiñones, Emery D. Berger, Guillem Bernat, Francisco J. Cazorla:
Using Randomized Caches in Probabilistic Real-Time Systems. ECRTS 2009: 129-138

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.