1.4k citations
- D. N. Brown16 profiles62
- C. Hearty3 profiles39 · h 59
- C. Touramanis2 profiles39 · h 67
- G. Vasseur16 profiles39 · h 71
- R. Sacco5 profiles39 · h 53
- G. Piredda7 profiles38 · h 56
- J. Albert4 profiles38 · h 99
- S. Emery4 profiles38 · h 65
- A. Soffer17 profiles37 · h 76
- F. Di Lodovico2 profiles37 · h 40
- M. Gaspero4 profiles37 · h 47
- A. Calcaterra4 profiles36 · h 62
- Centre National de la Recherche ScientifiqueFR45 papers
- Université Paris CitéFR45 papers
- Universitat de ValènciaES44 papers
- University of California, IrvineUS43 papers
- Imperial College LondonGB42 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR42 papers
- University of Maryland, College ParkUS42 papers
- Stanford UniversityUS41 papers
- The Ohio State UniversityUS41 papers
- University of PaduaIT41 papers
- University of Wisconsin–MadisonUS41 papers
- University of British ColumbiaCA40 papers
5 papers · 1 filter
Spin waves in micro-structured yttrium iron garnet nanometer-thick films
Matthias B. Jungfleisch, Wei Zhang, Wanjun Jiang +8
We investigated the spin-wave propagation in a micro-structured yttrium iron garnet waveguide of nm thickness. Utilizing spatially-resolved Brillouin light scattering microsco…
Critical Systems Development Using Modeling Languages. (CSDUML-04): Current Developments and Future Challenges (Report on the Third International Workshop)
Jan Jürjens, Eduardo B. Fernandez, Robert B. France +2
We give a short report on the contributions to and some discussions made and conclusions drawn at the Third International Workshop on Critical Systems Development Using Modeling La…
Limitations of Agile Software Processes
Dan Turk, Robert France, Bernhard Rumpe
Software developers and project managers are struggling to assess the appropriateness of agile processes to their development environments. This paper identifies limitations that a…
Erdős-Ko-Rado for Perfect Matchings
Nathan Lindzey
A perfect matching of a complete graph is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $…
Speeding Up Graph Algorithms via Switching Classes
Nathan Lindzey
Given a graph , a vertex switch of results in a new graph where neighbors of become nonneighbors and vice versa. This operation gives rise to an equivalence rel…