default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Schmid 0001
Person information
- affiliation: TU Wien, Faculty of Informatics, Vienna, Austria
Other persons with the same name
- Ulrich Schmid — disambiguation page
- Ulrich Schmid 0002 — TU Wien, Institute of Sensor and Actuator Systems, Vienna, Austria (and 1 more)
- Ulrich Schmid 0003 — FU Berlin, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid
, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86(6): 1830-1861 (2024)- [c82]Hans van Ditmarsch, Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid:
A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent Systems. IJCAR (2) 2024: 114-134 - [c81]Hugo Rincon Galeana, Ulrich Schmid:
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. SIROCCO 2024: 501-506 - [i33]Hans van Ditmarsch, Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid:
A Logic for Repair and State Recovery in Byzantine Fault-tolerant Multi-agent Systems. CoRR abs/2401.06451 (2024) - [i32]Arman Ferdowsi, Matthias Függer, Thomas Nowak, Michael Drmota, Ulrich Schmid:
Faithful Dynamic Timing Analysis of Digital Circuits Using Continuous Thresholded Mode-Switched ODEs. CoRR abs/2403.03235 (2024) - [i31]Arman Ferdowsi, Matthias Függer, Josef Salzmann, Ulrich Schmid:
A Hybrid Delay Model for Interconnected Multi-Input Gates. CoRR abs/2403.10540 (2024) - 2023
- [j49]Giorgio Cignarale, Ulrich Schmid, Tuomas E. Tahko, Roman Kuznets:
The Role of A Priori Belief in the Design and Analysis of Fault-Tolerant Distributed Systems. Minds Mach. 33(2): 293-319 (2023) - [c80]Daniel Öhlinger, Ulrich Schmid:
A Digital Delay Model Supporting Large Adversarial Delay Variations. DDECS 2023: 111-117 - [c79]Arman Ferdowsi, Matthias Függer, Josef Salzmann, Ulrich Schmid:
A Hybrid Delay Model for Interconnected Multi-Input Gates. DSD 2023: 381-390 - [c78]Giorgio Cignarale, Roman Kuznets, Hugo Rincon Galeana, Ulrich Schmid:
Logic of Communication Interpretation: How to Not Get Lost in Translation. FroCoS 2023: 119-136 - [c77]Arman Ferdowsi, Matthias Függer, Thomas Nowak, Ulrich Schmid:
Continuity of Thresholded Mode-Switched ODEs and Digital Circuit Delay Models. HSCC 2023: 10:1-10:11 - [c76]Arman Ferdowsi, Ulrich Schmid, Josef Salzmann:
Accurate Hybrid Delay Models for Dynamic Timing Analysis. ICCAD 2023: 1-9 - [c75]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS 2023: 100:1-100:28 - [c74]Thomas Schlögl, Ulrich Schmid:
A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems. TARK 2023: 487-506 - [i30]Daniel Öhlinger, Ulrich Schmid:
A Digital Delay Model Supporting Large Adversarial Delay Variations. CoRR abs/2301.09588 (2023) - [i29]Arman Ferdowsi, Matthias Függer, Thomas Nowak, Ulrich Schmid:
Continuity of Thresholded Mode-Switched ODEs and Digital Circuit Delay Models. CoRR abs/2303.14048 (2023) - [i28]Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler, Ami Paz, Stefan Schmid:
Topological Characterization of Consensus Solvability in Directed Dynamic Networks. CoRR abs/2304.02316 (2023) - [i27]Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, Ulrich Schmid:
Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). Dagstuhl Reports 13(7): 34-65 (2023) - 2022
- [c73]Matthias Függer, Christoph Lenzen, Ulrich Schmid:
On Specifications and Proofs of Timed Circuits. Principles of Systems Design 2022: 107-130 - [c72]Arman Ferdowsi, Jürgen Maier, Daniel Öhlinger, Ulrich Schmid:
A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate. DATE 2022: 1461-1466 - [c71]Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid:
Continuous Tasks and the Asynchronous Computability Theorem. ITCS 2022: 73:1-73:27 - [i26]Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid, Kyrill Winkler:
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. CoRR abs/2202.12397 (2022) - [i25]Matthias Függer, Christoph Lenzen, Ulrich Schmid:
On Specifications and Proofs of Timed Circuits. CoRR abs/2208.08147 (2022) - [i24]Arman Ferdowsi, Ulrich Schmid, Josef Salzmann:
An Accurate Hybrid Delay Model for Multi-Input Gates. CoRR abs/2211.10628 (2022) - 2021
- [j48]Martin Zeiner, Ulrich Schmid, Krishnendu Chatterjee:
Optimal strategies for selecting coordinators. Discret. Appl. Math. 289: 392-415 (2021) - [j47]Daniel Öhlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid:
The Involution Tool for Accurate Digital Timing and Power Analysis. Integr. 76: 87-98 (2021) - [c70]Kyrill Winkler, Ulrich Schmid, Thomas Nowak:
Valency-Based Consensus Under Message Adversaries Without Limit-Closure. FCT 2021: 457-474 - [c69]Jürgen Maier, Daniel Öhlinger, Ulrich Schmid, Matthias Függer, Thomas Nowak:
A Composable Glitch-Aware Delay Model. ACM Great Lakes Symposium on VLSI 2021: 147-154 - [c68]Manfred Schwarz, Ulrich Schmid:
Round-Oblivious Stabilizing Consensus in Dynamic Networks. SSS 2021: 154-172 - [c67]Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid:
Fire! TARK 2021: 139-153 - [i23]Jürgen Maier, Daniel Öhlinger, Ulrich Schmid, Matthias Függer, Thomas Nowak:
A Composable Glitch-Aware Delay Model. CoRR abs/2104.10966 (2021) - [i22]Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid:
Continuous Tasks and the Chromatic Simplicial Approximation Theorem. CoRR abs/2109.01439 (2021) - [i21]Arman Ferdowsi, Jürgen Maier, Daniel Öhlinger, Ulrich Schmid:
A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate. CoRR abs/2111.11182 (2021) - 2020
- [j46]Matthias Függer, Robert Najvirt, Thomas Nowak, Ulrich Schmid:
A Faithful Binary Circuit Model. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(10): 2784-2797 (2020) - [j45]Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee:
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3981-3992 (2020) - [c66]Thomas Schlögl, Ulrich Schmid, Roman Kuznets:
The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks. PRIMA 2020: 403-411 - [i20]Matthias Függer, Jürgen Maier, Robert Najvirt, Thomas Nowak, Ulrich Schmid:
A Faithful Binary Circuit Model with Adversarial Noise. CoRR abs/2006.08485 (2020) - [i19]Thomas Schlögl, Ulrich Schmid, Roman Kuznets:
The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks. CoRR abs/2011.01057 (2020)
2010 – 2019
- 2019
- [j44]Martin Zeiner, Manfred Schwarz, Ulrich Schmid:
On linear-time data dissemination in dynamic rooted trees. Discret. Appl. Math. 255: 307-319 (2019) - [j43]Kyrill Winkler, Manfred Schwarz, Ulrich Schmid:
Consensus in rooted dynamic networks with short-lived stability. Distributed Comput. 32(5): 443-458 (2019) - [j42]Kyrill Winkler, Ulrich Schmid:
An Overview of Recent Results for Consensus in Directed Dynamic Networks. Bull. EATCS 128 (2019) - [c65]Jürgen Maier, Matthias Függer, Thomas Nowak, Ulrich Schmid:
Transistor-Level Analysis of Dynamic Delay Models. ASYNC 2019: 76-85 - [c64]Roman Kuznets, Laurent Prosperi, Ulrich Schmid, Krisztina Fruzsa:
Epistemic Reasoning with Byzantine-Faulty Agents. FroCos 2019: 259-276 - [c63]Kyrill Winkler, Ulrich Schmid, Yoram Moses:
A Characterization of Consensus Solvability for Closed Message Adversaries. OPODIS 2019: 17:1-17:16 - [c62]Daniel Öhlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid:
The Involution Tool for Accurate Digital Timingand Power Analysis. PATMOS 2019: 1-8 - [c61]Prasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid:
2019 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2019: 2 - [c60]Thomas Nowak, Ulrich Schmid, Kyrill Winkler:
Topological Characterization of Consensus under General Message Adversaries. PODC 2019: 218-227 - [c59]Hugo Rincon Galeana, Kyrill Winkler, Ulrich Schmid, Sergio Rajsbaum:
A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus. SSS 2019: 307-322 - [c58]Roman Kuznets, Laurent Prosperi, Ulrich Schmid, Krisztina Fruzsa:
Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems. TARK 2019: 293-312 - [i18]Thomas Nowak, Ulrich Schmid, Kyrill Winkler:
Topological Characterization of Consensus under General Message Adversaries. CoRR abs/1905.09590 (2019) - 2018
- [j41]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
Automated competitive analysis of real-time scheduling with graph games. Real Time Syst. 54(1): 166-207 (2018) - [j40]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
Gracefully degrading consensus and k-set agreement in directed dynamic networks. Theor. Comput. Sci. 726: 41-77 (2018) - [c57]Chuchu Fan, Yu Meng, Jürgen Maier, Ezio Bartocci, Sayan Mitra, Ulrich Schmid:
Verifying nonlinear analog and mixed-signal circuits with inputs. ADHS 2018: 241-246 - [c56]Matthias Függer, Jürgen Maier, Robert Najvirt, Thomas Nowak, Ulrich Schmid:
A faithful binary circuit model with adversarial noise. DATE 2018: 1327-1332 - [c55]Martin Perner, Ulrich Schmid:
Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures. IOLTS 2018: 157-164 - [c54]Yehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid, Gadi Taubenfeld:
2018 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2018: 1 - [c53]Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks. SIROCCO 2018: 102-120 - [c52]Daniel Pfleger, Ulrich Schmid:
On Knowledge and Communication Complexity in Distributed Systems. SIROCCO 2018: 312-330 - [e2]Ulrich Schmid, Josef Widder:
32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. LIPIcs 121, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-092-7 [contents] - [i17]Chuchu Fan, Yu Meng, Jürgen Maier, Ezio Bartocci, Sayan Mitra, Ulrich Schmid:
Verifying nonlinear analog and mixed-signal circuits with inputs. CoRR abs/1803.02975 (2018) - 2017
- [j39]Varadan Savulimedu Veeravalli, Andreas Steininger, Ulrich Schmid:
A versatile architecture for long-term monitoring of single-event transient durations. Microprocess. Microsystems 53: 130-144 (2017) - [i16]Manfred Schwarz, Martin Zeiner, Ulrich Schmid:
Linear-Time Data Dissemination in Dynamic Networks. CoRR abs/1701.06800 (2017) - 2016
- [j38]Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid:
HEX: Scaling honeycombs is easier than scaling clock trees. J. Comput. Syst. Sci. 82(5): 929-956 (2016) - [j37]Matthias Függer, Thomas Nowak, Ulrich Schmid:
Unfaithful Glitch Propagation in Existing Binary Circuit Models. IEEE Trans. Computers 65(3): 964-978 (2016) - [c51]Manfred Schwarz, Kyrill Winkler, Ulrich Schmid:
Fast consensus under eventually stabilizing message adversaries. ICDCN 2016: 7:1-7:10 - [i15]Kyrill Winkler, Manfred Schwarz, Ulrich Schmid:
Consensus in Directed Dynamic Networks with Short-Lived Stability. CoRR abs/1602.05852 (2016) - 2015
- [j36]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid, Andreas Steininger:
Fault-tolerant Distributed Systems in Hardware. Bull. EATCS 116 (2015) - [j35]Andreas Steininger, Horst Zimmermann, Axel Jantsch, Michael Hofbauer, Ulrich Schmid, Kurt Schweiger, Varadan Savulimedu Veeravalli:
Building reliable systems-on-chip in nanoscale technologies. Elektrotech. Informationstechnik 132(6): 301-306 (2015) - [j34]Matthias Függer, Alexander Kößler, Thomas Nowak, Ulrich Schmid, Martin Zeiner:
The effect of forgetting on the performance of a synchronizer. Perform. Evaluation 93: 1-16 (2015) - [c50]Matthias Függer, Robert Najvirt, Thomas Nowak, Ulrich Schmid:
Towards binary circuit models that faithfully capture physical solvability. DATE 2015: 1455-1460 - [c49]Robert Najvirt, Ulrich Schmid, Michael Hofbauer, Matthias Függer, Thomas Nowak, Kurt Schweiger:
Experimental Validation of a Faithful Binary Circuit Model. ACM Great Lakes Symposium on VLSI 2015: 355-360 - [c48]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. NETYS 2015: 109-124 - [i14]Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. CoRR abs/1501.02716 (2015) - [i13]Manfred Schwarz, Kyrill Winkler, Ulrich Schmid:
Fast Consensus under Eventually Stabilizing Message Adversaries. CoRR abs/1508.00851 (2015) - 2014
- [j33]Heinrich Moser, Ulrich Schmid:
Reconciling fault-tolerant distributed algorithms and real-time computing. Distributed Comput. 27(3): 203-230 (2014) - [j32]Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen:
Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. J. ACM 61(5): 30:1-30:74 (2014) - [j31]Danny Dolev, Matthias Függer, Markus Posch, Ulrich Schmid, Andreas Steininger, Christoph Lenzen:
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. J. Comput. Syst. Sci. 80(4): 860-900 (2014) - [j30]Martin Biely, Peter Robinson, Ulrich Schmid:
The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. IEEE Trans. Parallel Distributed Syst. 25(4): 1078-1088 (2014) - [c47]Varadan Savulimedu Veeravalli, Andreas Steininger, Ulrich Schmid:
Measuring SET pulsewidths in logic gates using digital infrastructure. ISQED 2014: 236-242 - [c46]Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson:
Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. PODC 2014: 341-343 - [c45]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. RTSS 2014: 118-127 - [c44]Annu Gmeiner, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms. SFM 2014: 122-171 - [i12]Matthias Függer, Robert Najvirt, Thomas Nowak, Ulrich Schmid:
Faithful Glitch Propagation in Binary Circuit Models. CoRR abs/1406.2544 (2014) - [i11]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. CoRR abs/1409.2291 (2014) - 2013
- [j29]Varadan Savulimedu Veeravalli, Thomas Polzer, Ulrich Schmid, Andreas Steininger, Michael Hofbauer, Kurt Schweiger, Horst Dietrich, Kerstin Schneider-Hornstein, Horst Zimmermann, Kay-Obbe Voss, Bruno Merk, Michael Hajek:
An infrastructure for accurate characterization of single-event transients in digital circuits. Microprocess. Microsystems 37(8-A): 772-791 (2013) - [c43]Matthias Függer, Alexander Kößler, Thomas Nowak, Ulrich Schmid, Martin Zeiner:
The Effect of Forgetting on the Performance of a Synchronizer. ALGOSENSORS 2013: 185-200 - [c42]Matthias Függer, Thomas Nowak, Ulrich Schmid:
Unfaithful Glitch Propagation in Existing Binary Circuit Models. ASYNC 2013: 191-199 - [c41]Christoph Lenzen, Matthias Függer, Markus Hofstatter, Ulrich Schmid:
Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. DSD 2013: 142-151 - [c40]Jörg Reitterer, Franz Fidler, Ferdinand Saint Julien-Wallsee, Gerhard Schmid, Wolfgang Gartner, Walter Leeb, Ulrich Schmid:
Large-scale autostereoscopic outdoor display. SD&A 2013: 86480G - [c39]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Parameterized model checking of fault-tolerant distributed algorithms by abstraction. FMCAD 2013: 201-209 - [c38]Krishnendu Chatterjee, Alexander Kößler, Ulrich Schmid:
Automated analysis of real-time scheduling using graph games. HSCC 2013: 163-172 - [c37]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction. PODC 2013: 119-121 - [c36]Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid:
HEX: scaling honeycombs is easier than scaling clock trees. SPAA 2013: 164-175 - [c35]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms. SPIN 2013: 209-226 - [i10]Matthias Függer, Thomas Nowak, Ulrich Schmid:
Unfaithful Glitch Propagation in Existing Binary Circuit Models. CoRR abs/1311.1423 (2013) - 2012
- [j28]Matthias Függer, Ulrich Schmid:
Reconciling fault-tolerant distributed computing and systems-on-chip. Distributed Comput. 24(6): 323-355 (2012) - [c34]Varadan Savulimedu Veeravalli, Thomas Polzer, Andreas Steininger, Ulrich Schmid:
Architecture and Design Analysis of a Digital Single-Event Transient/Upset Measurement Chip. DSD 2012: 8-17 - [c33]Martin Biely, Peter Robinson, Ulrich Schmid:
Agreement in Directed Dynamic Networks. SIROCCO 2012: 73-84 - [i9]Danny Dolev, Matthias Függer, Christoph Lenzen, Markus Posch, Ulrich Schmid, Andreas Steininger:
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs. CoRR abs/1202.1925 (2012) - [i8]Martin Biely, Peter Robinson, Ulrich Schmid:
Agreement in Directed Dynamic Networks. CoRR abs/1204.0641 (2012) - [i7]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms. CoRR abs/1210.3839 (2012) - [i6]Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder:
Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms. CoRR abs/1210.3846 (2012) - 2011
- [j27]Peter Robinson, Ulrich Schmid:
The Asynchronous Bounded-Cycle model. Theor. Comput. Sci. 412(40): 5580-5601 (2011) - [j26]Martin Biely, Ulrich Schmid, Bettina Weiss:
Synchronous consensus under hybrid process and link failures. Theor. Comput. Sci. 412(40): 5602-5630 (2011) - [c32]Martin Biely, Peter Robinson, Ulrich Schmid:
Solving k-Set Agreement with Stable Skeleton Graphs. IPDPS Workshops 2011: 1488-1495 - [c31]Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. OPODIS 2011: 299-312 - [c30]Martin Biely, Peter Robinson, Ulrich Schmid:
Easy impossibility proofs for k-set agreement in message passing systems. PODC 2011: 227-228 - [c29]Heinrich Moser, Ulrich Schmid:
Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing - (Extended Abstract). SIROCCO 2011: 42-53 - [c28]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. SSS 2011: 163-177 - [i5]Martin Biely, Peter Robinson, Ulrich Schmid:
Solving k-Set Agreement with Stable Skeleton Graphs. CoRR abs/1102.4423 (2011) - [i4]Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. CoRR abs/1103.3671 (2011) - [i3]Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation. CoRR abs/1105.4780 (2011) - 2010
- [j25]Bernd Thallner, Heinrich Moser, Ulrich Schmid:
Topology control for fault-tolerant communication in wireless ad hoc networks. Wirel. Networks 16(2): 387-404 (2010) - [c27]Matthias Függer, Andreas Dielacher, Ulrich Schmid:
How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining. EDCC 2010: 230-239 - [c26]Ulrich Schmid:
Synchrony and Time in Fault-Tolerant Distributed Algorithms - (Invited Tutorial). FORMATS 2010: 46
2000 – 2009
- 2009
- [j24]Josef Widder, Ulrich Schmid:
The Theta-Model: achieving synchrony without clocks. Distributed Comput. 22(1): 29-47 (2009) - [j23]Ulrich Schmid, Bettina Weiss, Idit Keidar:
Impossibility Results and Lower Bounds for Consensus under Link Failures. SIAM J. Comput. 38(5): 1912-1951 (2009) - [j22]Martin Hutle, Dahlia Malkhi, Ulrich Schmid, Lidong Zhou:
Chasing the Weakest System Model for Implementing Ω and Consensus. IEEE Trans. Dependable Secur. Comput. 6(4): 269-281 (2009) - [c25]Martin Biely, Peter Robinson, Ulrich Schmid:
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. OPODIS 2009: 285-299 - [c24]Andreas Dielacher, Matthias Függer, Ulrich Schmid:
Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipelining. PODC 2009: 276-277 - [c23]Martin Biely, Peter Robinson, Ulrich Schmid:
Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. DISC 2009: 360-361 - 2008
- [c22]Gottfried Fuchs, Matthias Függer, Ulrich Schmid, Andreas Steininger:
Mapping a Fault-Tolerant Distributed Algorithm to Systems on Chip. DSD 2008: 242-249 - [c21]Heinrich Moser, Ulrich Schmid:
Optimal Deterministic Remote Clock Estimation in Real-Time Systems. OPODIS 2008: 363-387 - [c20]Peter Robinson, Ulrich Schmid:
The asynchronous bounded-cycle model. PODC 2008: 423 - [c19]Ulrich Schmid:
Keynote: Distributed Algorithms and VLSI. SSS 2008: 3 - [c18]Peter Robinson, Ulrich Schmid:
The Asynchronous Bounded-Cycle Model. SSS 2008: 246-262 - [e1]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
Fault-Tolerant Distributed Algorithms on VLSI Chips, 07.09. - 10.09.2008. Dagstuhl Seminar Proceedings 08371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i2]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
08371 Abstracts Collection - Fault-Tolerant Distributed Algorithms on VLSI Chips. Fault-Tolerant Distributed Algorithms on VLSI Chips 2008 - [i1]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
08371 Summary - Fault-Tolerant Distributed Algorithms on VLSI Chips. Fault-Tolerant Distributed Algorithms on VLSI Chips 2008 - 2007
- [j21]Josef Widder, Ulrich Schmid:
Booting clock synchronization in partially synchronous systems with hybrid process and link failures. Distributed Comput. 20(2): 115-140 (2007) - [j20]Ulrich Schmid, Andreas Steininger, Manfred Sust:
FIT-IT-Projekt DARTS: dezentrale fehlertolerante Taktgenerierung. Elektrotech. Informationstechnik 124(1-2): 3-8 (2007) - 2006
- [c17]Matthias Függer, Ulrich Schmid, Gottfried Fuchs, Gerald Kempf:
Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip. EDCC 2006: 87-96 - [c16]Heinrich Moser, Ulrich Schmid:
Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems. OPODIS 2006: 94-109 - [c15]Martin Hutle, Dahlia Malkhi, Ulrich Schmid, Lidong Zhou:
Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus. SSS 2006: 576-577 - 2005
- [c14]Josef Widder, Gérard Le Lann, Ulrich Schmid:
Failure Detection with Booting in Partially Synchronous Systems. EDCC 2005: 20-37 - [c13]Christof Fetzer, Ulrich Schmid, Martin Süßkraut:
On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times. ICDCS 2005: 271-280 - [c12]Martin Biely, Gérard Le Lann, Ulrich Schmid:
Proof-Based System Engineering Using a Virtual System Model. ISAS 2005: 164-179 - 2004
- [c11]Christof Fetzer, Ulrich Schmid:
Brief announcement: on the possibility of consensus in asynchronous systems with finite average response times. PODC 2004: 402 - 2003
- [j19]Ulrich Schmid, Klaus Schossmaier:
Interval-based clock synchronization with optimal precision. Inf. Comput. 186(1): 36-77 (2003) - [c10]Ulrich Schmid, Christof Fetzer:
Randomized Asynchronous Consensus with Imperfect Communications. SRDS 2003: 361-370 - 2002
- [c9]Ulrich Schmid, Bettina Weiss, John M. Rushby:
Formally Verified Byzantine Agreement in Presence of Link Faults. ICDCS 2002: 608-616 - 2001
- [j18]Ulrich Schmid:
Applied research: a scientist's perspective. Annu. Rev. Control. 25: 183-190 (2001) - [j17]Ulrich Schmid, Klaus Schossmaier:
How to reconcile fault-tolerant interval intersection with the Lipschitz condition. Distributed Comput. 14(2): 101-111 (2001) - [c8]Ulrich Schmid:
How to Model Link Failures: A Perception-Based Fault Model. DSN 2001: 57 - [c7]Bettina Weiss, Ulrich Schmid:
Consensus with Written Messages Under Link Faults. SRDS 2001: 194-197 - 2000
- [j16]Ulrich Schmid:
Orthogonal Accuracy Clock Synchronization. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j15]Ulrich Schmid, Johann Klasek, Thomas Mandl, Herbert Nachtnebel, Gerhard R. Cadek, Nikolaus Kerö:
A Network Time Interface M-Module for Distributing GPS-Time over LANs. Real Time Syst. 18(1): 25-57 (2000)
1990 – 1999
- 1999
- [c6]Bettina Weiss, Günther Gridling, Ulrich Schmid, Klaus Schossmaier:
The SimUTC Fault-Tolerant Distributed Systems Simulation Toolkit. MASCOTS 1999: 68-75 - 1998
- [c5]Wolfgang A. Halang, K. H. Kim, Kinji Mori, Ulrich Schmid, Horst F. Wedde:
Real-Time Systems - Panel Overview. COMPSAC 1998: 338-343 - [c4]Martin Horauer, Ulrich Schmid, Klaus Schossmaier:
NTI: A Network Time Interface M-Module for High-Accuracy Clock-Synchronization. IPPS/SPDP Workshops 1998: 1067-1076 - 1997
- [j14]Ulrich Schmid:
Static priority scheduling of aperiodic real-time tasks. Random Struct. Algorithms 10(1-2): 257-303 (1997) - [j13]Ulrich Schmid, Klaus Schossmaier:
Interval-based Clock Synchronization. Real Time Syst. 12(2): 173-228 (1997) - [j12]Klaus Schossmaier, Ulrich Schmid, Martin Horauer, Dietmar Loy:
Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU). Real Time Syst. 12(3): 295-327 (1997) - 1995
- [j11]Ulrich Schmid, Alfred Pusterhofer:
SSCMP: The Sequenced Synchronized Clock Message Protocol. Comput. Networks ISDN Syst. 27(12): 1615-1632 (1995) - [j10]Ulrich Schmid, Johann Blieberger:
On Nonpreemptive LCFS Scheduling with Deadlines. J. Algorithms 18(1): 124-158 (1995) - [j9]Ulrich Schmid:
Random Trees in Queueing Systems with Deadlines. Theor. Comput. Sci. 144(1&2): 277-314 (1995) - 1994
- [j8]Ulrich Schmid:
Monitoring Distributed Real-Times. Real Time Syst. 7(1): 33-56 (1994) - 1993
- [j7]Michael Drmota, Ulrich Schmid:
Exponential Limiting Distributions in Queueing Systems with Deadlines. SIAM J. Appl. Math. 53(1): 301-318 (1993) - [j6]Ulrich Schmid:
The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm. Theor. Comput. Sci. 108(2): 291-310 (1993) - [j5]Michael Drmota, Ulrich Schmid:
The analysis of the expected successful operation time of slotted Aloha. IEEE Trans. Inf. Theory 39(5): 1567-1577 (1993) - 1992
- [j4]Johann Blieberger, Ulrich Schmid:
FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions. BIT 32(3): 370-383 (1992) - [j3]Ulrich Schmid:
On a tree collision resolution algorithm in presence of capture. RAIRO Theor. Informatics Appl. 26: 163-197 (1992) - [j2]Ulrich Schmid, Johann Blieberger:
Some Investigations on FCFS Scheduling in Hard Real Time Applications. J. Comput. Syst. Sci. 45(3): 493-512 (1992) - [j1]Johann Blieberger, Ulrich Schmid:
Preemptive LCFS Scheduling in Hard Real-Time Applications. Perform. Evaluation 15(3): 203-215 (1992) - [c3]Ulrich Schmid:
The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects. ICALP 1992: 223-234 - [c2]Ulrich Schmid:
Monitoring of Distributed Real-Time Systems. NATO ASI RTC 1992: 582-583 - [c1]Ulrich Schmid:
The Role of Standards in Real-Time Computing. NATO ASI RTC 1992: 638-639
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
