--- _id: '5191' abstract: - lang: eng text: This study examines the relevance of financial and non-financial information for the valuation of venture capital (VC) investments. Based on a hand-collected data set on venture-backed start-ups in Germany, we investigate the internal due diligence documents of over 200 investment rounds. We document that balance sheet and income statement items capture as much economic content as verifiable non-financial information (e.g. team experience or the number of patents) while controlling for several deal characteristics (e.g. industry, investment round, or yearly VC fund inflows). In addition, we show that valuations based on accounting and non-accounting information yield a level of valuation accuracy that is comparable to that of publicly traded firms. Further analyses show that the industry-specific total asset multiples outperform the popular revenue multiples but lead to significantly less accurate results than those obtained from the more comprehensive valuation models. Overall, our findings might inform researchers and standard-setters of the usefulness of accounting information for investment companies and provide additional evidence to gauge the overall valuation accuracy in VC settings. article_type: original author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Christopher F full_name: Mokwa, Christopher F last_name: Mokwa - first_name: Georg full_name: Keienburg, Georg last_name: Keienburg citation: ama: Sievers S, Mokwa CF, Keienburg G. The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A). 2013;22(3):467-511. doi:10.1080/09638180.2012.741051 apa: Sievers, S., Mokwa, C. F., & Keienburg, G. (2013). The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A), 22(3), 467–511. https://doi.org/10.1080/09638180.2012.741051 bibtex: '@article{Sievers_Mokwa_Keienburg_2013, title={The relevance of financial versus non-financial information for the valuation of venture capital-backed firms}, volume={22}, DOI={10.1080/09638180.2012.741051}, number={3}, journal={European Accounting Review (VHB-JOURQUAL 3 Ranking A)}, publisher={Taylor \& Francis}, author={Sievers, Sönke and Mokwa, Christopher F and Keienburg, Georg}, year={2013}, pages={467–511} }' chicago: 'Sievers, Sönke, Christopher F Mokwa, and Georg Keienburg. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22, no. 3 (2013): 467–511. https://doi.org/10.1080/09638180.2012.741051.' ieee: S. Sievers, C. F. Mokwa, and G. Keienburg, “The relevance of financial versus non-financial information for the valuation of venture capital-backed firms,” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, pp. 467–511, 2013. mla: Sievers, Sönke, et al. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, Taylor \& Francis, 2013, pp. 467–511, doi:10.1080/09638180.2012.741051. short: S. Sievers, C.F. Mokwa, G. Keienburg, European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22 (2013) 467–511. date_created: 2018-10-31T11:27:42Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' doi: 10.1080/09638180.2012.741051 extern: '1' intvolume: ' 22' issue: '3' jel: - G24 - G32 - M41 keyword: - value relevance - equity valuation - venture capital - human capital - start-ups language: - iso: eng main_file_link: - url: http://www.tandfonline.com/doi/full/10.1080/09638180.2012.741051 page: 467-511 publication: European Accounting Review (VHB-JOURQUAL 3 Ranking A) publication_status: published publisher: Taylor \& Francis quality_controlled: '1' related_material: link: - relation: earlier_version url: http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1449740 status: public title: The relevance of financial versus non-financial information for the valuation of venture capital-backed firms type: journal_article user_id: '46447' volume: 22 year: '2013' ... --- _id: '5192' abstract: - lang: eng text: For the valuation of fast growing innovative firms Schwartz and Moon (Financ Anal J 56:62–75, 2000), (Financ Rev 36:7–26, 2001) develop a fundamental valuation model where key parameters follow stochastic processes. While prior research shows promising potential for this model, it has never been tested on a large scale dataset. Thus, guided by economic theory, this paper is the first to design a large-scale applicable implementation on around 30,000 technology firm quarter observations from 1992 to 2009 for the US to assess this model. Evaluating the feasibility and performance of the Schwartz-Moon model reveals that it is comparably accurate to the traditional sales multiple with key advantages in valuing small and non-listed firms. Most importantly, however, the model is able to indicate severe market over- or undervaluation from a fundamental perspective. We demonstrate that a trading strategy based on our implementation has significant investment value. Consequently, the model seems suitable for detecting misvaluations as the dot-com bubble. article_type: original author: - first_name: Jan full_name: Klobucnik, Jan last_name: Klobucnik - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: Klobucnik J, Sievers S. Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B). 2013;83(9):947-984. doi:https://doi.org/10.1007/s11573-013-0684-2 apa: Klobucnik, J., & Sievers, S. (2013). Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), 83(9), 947–984. https://doi.org/10.1007/s11573-013-0684-2 bibtex: '@article{Klobucnik_Sievers_2013, title={Valuing high technology growth firms}, volume={83}, DOI={https://doi.org/10.1007/s11573-013-0684-2}, number={9}, journal={Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)}, publisher={Springer}, author={Klobucnik, Jan and Sievers, Sönke}, year={2013}, pages={947–984} }' chicago: 'Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83, no. 9 (2013): 947–84. https://doi.org/10.1007/s11573-013-0684-2.' ieee: J. Klobucnik and S. Sievers, “Valuing high technology growth firms,” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, pp. 947–984, 2013. mla: Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, Springer, 2013, pp. 947–84, doi:https://doi.org/10.1007/s11573-013-0684-2. short: J. Klobucnik, S. Sievers, Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83 (2013) 947–984. date_created: 2018-10-31T11:31:56Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' doi: https://doi.org/10.1007/s11573-013-0684-2 extern: '1' intvolume: ' 83' issue: '9' jel: - G11 - G12 - G17 - G33 keyword: - Schwartz-Moon model - Market mispricing - Empirical test - Company valuation - Trading strategy language: - iso: eng main_file_link: - url: https://link.springer.com/article/10.1007/s11573-013-0684-2 page: 947-984 publication: Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) publication_status: published publisher: Springer quality_controlled: '1' status: public title: Valuing high technology growth firms type: journal_article user_id: '46447' volume: 83 year: '2013' ... --- _id: '520' abstract: - lang: eng text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea. author: - first_name: Philip full_name: Wette, Philip last_name: Wette - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733' apa: Wette, P., & Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52). https://doi.org/10.1109/INFCOMW.2013.6970733 bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }' chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733. ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52. mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733. short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:43Z ddc: - '040' department: - _id: '75' doi: 10.1109/INFCOMW.2013.6970733 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:38:04Z date_updated: 2018-03-15T10:38:04Z file_id: '1298' file_name: 520-wetteinfocom2013.pdf file_size: 131502 relation: main_file success: 1 file_date_updated: 2018-03-15T10:38:04Z has_accepted_license: '1' main_file_link: - url: http://ieeexplore.ieee.org/document/6970733/ page: 51-52 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) status: public title: Incorporating feedback from application layer into routing and wavelength assignment algorithms type: conference user_id: '15504' year: '2013' ... --- _id: '5201' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Tobias full_name: Schlüter, Tobias last_name: Schlüter - first_name: Thomas full_name: Hartmann-Wendels, Thomas last_name: Hartmann-Wendels citation: ama: Sievers S, Schlüter T, Hartmann-Wendels T. Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. 2013. apa: Sievers, S., Schlüter, T., & Hartmann-Wendels, T. (2013). Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. bibtex: '@article{Sievers_Schlüter_Hartmann-Wendels_2013, title={Die erfolgreiche Bindung des Sparers an die Bank}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Schlüter, Tobias and Hartmann-Wendels, Thomas}, year={2013} }' chicago: Sievers, Sönke, Tobias Schlüter, and Thomas Hartmann-Wendels. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013. ieee: S. Sievers, T. Schlüter, and T. Hartmann-Wendels, “Die erfolgreiche Bindung des Sparers an die Bank,” Börsen-Zeitung, 2013. mla: Sievers, Sönke, et al. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013. short: S. Sievers, T. Schlüter, T. Hartmann-Wendels, Börsen-Zeitung (2013). date_created: 2018-10-31T12:29:38Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' language: - iso: ger main_file_link: - url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013018054&titel=Die-erfolgreiche-Bindung-des-Sparers-an-die-Bank publication: Börsen-Zeitung publication_date: 2013-01-10 publication_status: published status: public title: Die erfolgreiche Bindung des Sparers an die Bank type: newspaper_article user_id: '46447' year: '2013' ... --- _id: '5202' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Thomas full_name: Hartmann-Wendels, Thomas last_name: Hartmann-Wendels - first_name: Ramona full_name: Busch, Ramona last_name: Busch - first_name: Tobias full_name: Schlüter, Tobias last_name: Schlüter citation: ama: Sievers S, Hartmann-Wendels T, Busch R, Schlüter T. Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. 2013. apa: Sievers, S., Hartmann-Wendels, T., Busch, R., & Schlüter, T. (2013). Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. bibtex: '@article{Sievers_Hartmann-Wendels_Busch_Schlüter_2013, title={Wie Banken Kostenvorteile weitergeben}, volume={6}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}, year={2013} }' chicago: Sievers, Sönke, Thomas Hartmann-Wendels, Ramona Busch, and Tobias Schlüter. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, 2013. ieee: S. Sievers, T. Hartmann-Wendels, R. Busch, and T. Schlüter, “Wie Banken Kostenvorteile weitergeben,” Börsen-Zeitung, vol. 6, 2013. mla: Sievers, Sönke, et al. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, vol. 6, 2013. short: S. Sievers, T. Hartmann-Wendels, R. Busch, T. Schlüter, Börsen-Zeitung 6 (2013). date_created: 2018-10-31T12:32:09Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' intvolume: ' 6' language: - iso: ger main_file_link: - url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013006066 page: '6' publication: Börsen-Zeitung publication_date: 2013-01-10 publication_status: published status: public title: Wie Banken Kostenvorteile weitergeben type: newspaper_article user_id: '46447' volume: 6 year: '2013' ... --- _id: '521' author: - first_name: Heinrich full_name: Riebler, Heinrich id: '8961' last_name: Riebler citation: ama: Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn; 2013. apa: Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn. bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }' chicago: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. ieee: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. mla: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:46Z department: - _id: '27' - _id: '518' keyword: - coldboot language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs type: mastersthesis user_id: '477' year: '2013' ... --- _id: '522' author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 citation: ama: 'Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn; 2013.' apa: 'Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn.' bibtex: '@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }' chicago: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' ieee: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' mla: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' short: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.' date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:47Z department: - _id: '79' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Teilprojekt A - _id: '5' name: SFB 901 - Subprojekt A1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths' type: mastersthesis user_id: '14052' year: '2013' ... --- _id: '523' abstract: - lang: eng text: In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist. author: - first_name: Marios full_name: Mavronicolas, Marios last_name: Mavronicolas - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien - first_name: Vicky full_name: Papadopoulou Lesta, Vicky last_name: Papadopoulou Lesta citation: ama: Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? Discrete Applied Mathematics. 2013;161(16-17):2563-2586. doi:10.1016/j.dam.2013.05.022 apa: Mavronicolas, M., Monien, B., & Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? Discrete Applied Mathematics, 161(16–17), 2563–2586. https://doi.org/10.1016/j.dam.2013.05.022 bibtex: '@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={10.1016/j.dam.2013.05.022}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }' chicago: 'Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics 161, no. 16–17 (2013): 2563–86. https://doi.org/10.1016/j.dam.2013.05.022.' ieee: M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” Discrete Applied Mathematics, vol. 161, no. 16–17, pp. 2563–2586, 2013. mla: Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:10.1016/j.dam.2013.05.022. short: M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:47Z ddc: - '040' doi: 10.1016/j.dam.2013.05.022 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:37:35Z date_updated: 2018-03-15T10:37:35Z file_id: '1297' file_name: 523-MMP13.pdf file_size: 1127543 relation: main_file success: 1 file_date_updated: 2018-03-15T10:37:35Z has_accepted_license: '1' intvolume: ' 161' issue: 16-17 language: - iso: eng page: 2563-2586 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Discrete Applied Mathematics publisher: Elsevier status: public title: How many attackers can selfish defenders catch? type: journal_article user_id: '42447' volume: 161 year: '2013' ... --- _id: '524' abstract: - lang: eng text: 'We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Kamil full_name: Swirkot, Kamil last_name: Swirkot citation: ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013. apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv. bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }' chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013. ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013. mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013. short: F. Meyer auf der Heide, K. Swirkot, (2013). date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:48Z ddc: - '040' department: - _id: '63' external_id: arxiv: - '1311.7229' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:37:07Z date_updated: 2018-03-15T10:37:07Z file_id: '1296' file_name: 524-paper_01.pdf file_size: 534906 relation: main_file success: 1 file_date_updated: 2018-03-15T10:37:07Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: arXiv status: public title: Hierarchies in Local Distributed Decision type: preprint user_id: '15415' year: '2013' ... --- _id: '525' author: - first_name: Tim full_name: Niklas Vinkemeier, Tim last_name: Niklas Vinkemeier citation: ama: Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn; 2013. apa: Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn. bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }' chicago: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013. ieee: T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn, 2013. mla: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013. short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:48Z department: - _id: '75' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Haptics - Hadoop performance testing in concurrent job scenarios type: bachelorsthesis user_id: '15504' year: '2013' ...