Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
332 Publications
2012 |
Published |
Conference Paper |
IST-REx-ID: 6746
M. Mondelli, Q. Zhou, X. Ma, and V. Lottici, “A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems,” in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 2012, pp. 2905–2908.
View
| DOI
2012 |
Published |
Conference Paper |
IST-REx-ID: 763
D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.
View
| DOI
2012 |
Published |
Journal Article |
IST-REx-ID: 492 |
T. Galkovskyi et al., “GiA Roots: Software for the high throughput analysis of plant root system architecture,” BMC Plant Biology, vol. 12. BioMed Central, 2012.
[Published Version]
View
| Files available
| DOI
2012 |
Published |
Journal Article |
IST-REx-ID: 493 |
M. Tangermann et al., “Review of the BCI competition IV,” Frontiers in Neuroscience, vol. 6. Frontiers Research Foundation, 2012.
[Published Version]
View
| Files available
| DOI
2012 |
Published |
Conference Paper |
IST-REx-ID: 495 |
A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.
[Published Version]
View
| Files available
| DOI
2012 |
Published |
Conference Paper |
IST-REx-ID: 496 |
A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 |
Published |
Conference Paper |
IST-REx-ID: 497 |
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
[Published Version]
View
| Files available
| DOI