default search action
Stephan J. Eidenbenz
Person information
- affiliation: Los Alamos National Laboratory, NM, USA
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Erik Skau, Philip Romero, Stephan J. Eidenbenz, Boian S. Alexandrov:
Distributed out-of-memory NMF on CPU/GPU architectures. J. Supercomput. 80(3): 3970-3999 (2024) - [j31]Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Erik Skau, Philip Romero, Stephan J. Eidenbenz, Boian S. Alexandrov:
Correction to: Distributed out-of-memory NMF on CPU/GPU architectures. J. Supercomput. 80(4): 5731-5732 (2024) - [c121]Joel Rajakumar, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz:
Trainability Barriers in Low-Depth QAOA Landscapes. CF 2024 - [c120]Christo Meriwether Keller, Stephan J. Eidenbenz, Andreas Bärtschi, Daniel O'Malley, John K. Golden, Satyajayant Misra:
Hierarchical Multigrid Ansatz for Variational Quantum Algorithms. ISC 2024: 1-11 - [i38]Joel Rajakumar, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz:
Trainability Barriers in Low-Depth QAOA Landscapes. CoRR abs/2402.10188 (2024) - [i37]Reuben Tate, Stephan J. Eidenbenz:
Guarantees on Warm-Started QAOA: Single-Round Approximation Ratios for 3-Regular MAXCUT and Higher-Round Scaling Limits. CoRR abs/2402.12631 (2024) - [i36]Shamminuj Aktar, Andreas Bärtschi, Diane Oyen, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation. CoRR abs/2405.08100 (2024) - 2023
- [c119]Shamminuj Aktar, Abdel-Hameed A. Badawy, Andreas Bärtschi, Stephan J. Eidenbenz:
Scalable Experimental Bounds for Dicke and GHZ States Fidelities. CF 2023: 176-184 - [c118]Hamdy Abdelkhalik, Shamminuj Aktar, Yehia Arafa, Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Nishant Panda, Nirmal Prajapati, Nazmul Haque Turja, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
BB-ML: Basic Block Performance Prediction using Machine Learning Techniques. ICPADS 2023: 1975-1982 - [c117]Atanu Barai, Nandakishore Santhi, Abdur Razzak, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
LLVM Static Analysis for Program Characterization and Memory Reuse Profile Estimation. MEMSYS 2023: 3:1-3:6 - [c116]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
The Quantum Alternating Operator Ansatz for Satisfiability Problems. QCE 2023: 307-312 - [c115]Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Diane Oyen, Stephan J. Eidenbenz:
Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network. QCE 2023: 401-402 - [c114]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization. QCE 2023: 496-505 - [c113]Elijah Pelofske, Andreas Bärtschi, John K. Golden, Stephan J. Eidenbenz:
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices. QCE 2023: 506-517 - [c112]John K. Golden, Andreas Bärtschi, Dan O'Malley, Elijah Pelofske, Stephan J. Eidenbenz:
JuliQAOA: Fast, Flexible QAOA Simulation. SC Workshops 2023: 1454-1459 - [c111]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. ISC 2023: 240-258 - [i35]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. CoRR abs/2301.00520 (2023) - [i34]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
The Quantum Alternating Operator Ansatz for Satisfiability Problems. CoRR abs/2301.11292 (2023) - [i33]Elijah Pelofske, Andreas Bärtschi, John K. Golden, Stephan J. Eidenbenz:
High-Round QAOA for MAX k-SAT on Trapped Ion NISQ Devices. CoRR abs/2306.03238 (2023) - [i32]Elijah Pelofske, Vincent Russo, Ryan LaRose, Andrea Mari, Dan Strano, Andreas Bärtschi, Stephan J. Eidenbenz, William J. Zeng:
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation. CoRR abs/2306.15863 (2023) - [i31]Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos, John K. Golden, Nathan Lemons, Stephan J. Eidenbenz:
Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios. CoRR abs/2308.15442 (2023) - [i30]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Bryan Garcia, Boris Kiefer:
Probing Quantum Telecloning on Superconducting Quantum Processors. CoRR abs/2308.15579 (2023) - [i29]Atanu Barai, Nandakishore Santhi, Abdur Razzak, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
LLVM Static Analysis for Program Characterization and Memory Reuse Profile Estimation. CoRR abs/2311.12883 (2023) - [i28]Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Matthis Lehmkuehler, Stefan Woerner:
Provable bounds for noise-free expectation values computed from noisy samples. CoRR abs/2312.00733 (2023) - [i27]Elijah Pelofske, Andreas Bärtschi, Lukasz Cincio, John K. Golden, Stephan J. Eidenbenz:
Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs. CoRR abs/2312.00997 (2023) - [i26]Christo Meriwether Keller, Stephan J. Eidenbenz, Andreas Bärtschi, Daniel O'Malley, John K. Golden, Satyajayant Misra:
Hierarchical Multigrid Ansatz for Variational Quantum Algorithms. CoRR abs/2312.15048 (2023) - 2022
- [j30]Atanu Barai, Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling. J. Supercomput. 78(2): 2354-2385 (2022) - [c110]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. ICRC 2022: 51-56 - [c109]Andreas Bärtschi, Stephan J. Eidenbenz:
Short-Depth Circuits for Dicke State Preparation. QCE 2022: 87-96 - [c108]Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz:
Quantum Telecloning on NISQ Computers. QCE 2022: 605-616 - [d1]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset. IEEE DataPort, 2022 - [i25]John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz, Daniel O'Malley:
Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search. CoRR abs/2202.00648 (2022) - [i24]Shamminuj Aktar, Hamdy Abdelkhalik, Nazmul Haque Turja, Yehia Arafa, Atanu Barai, Nishant Panda, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
BB-ML: Basic Block Performance Prediction using Machine Learning Techniques. CoRR abs/2202.07798 (2022) - [i23]Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Erik Skau, Philip Romero, Stephan J. Eidenbenz, Boian S. Alexandrov:
Distributed Out-of-Memory NMF of Dense and Sparse Data on CPU/GPU Architectures with Automatic Model Selection for Exascale Data. CoRR abs/2202.09518 (2022) - [i22]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Volume in Practice: What Users Can Expect from NISQ Devices. CoRR abs/2203.03816 (2022) - [i21]Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz:
Quantum Telecloning on NISQ Computers. CoRR abs/2205.00125 (2022) - [i20]Andreas Bärtschi, Stephan J. Eidenbenz:
Short-Depth Circuits for Dicke State Preparation. CoRR abs/2207.09998 (2022) - [i19]Erik Skau, Andrew Hollis, Stephan J. Eidenbenz, Kim Ø. Rasmussen, Boian S. Alexandrov:
Process Modeling, Hidden Markov Models, and Non-negative Tensor Factorization with Model Selection. CoRR abs/2210.01060 (2022) - [i18]Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
Scalable Experimental Bounds for Entangled Quantum State Fidelities. CoRR abs/2210.03048 (2022) - [i17]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. CoRR abs/2210.10164 (2022) - 2021
- [j29]Gopinath Chennupati, Nandakishore Santhi, Phillip Romero, Stephan J. Eidenbenz:
Machine Learning-enabled Scalable Performance Prediction of Scientific Codes. ACM Trans. Model. Comput. Simul. 31(2): 11:1-11:28 (2021) - [c107]Ali Eker, Yehia Arafa, Abdel-Hameed A. Badawy, Nandakishore Santhi, Stephan J. Eidenbenz, Dmitry Ponomarev:
Load-Aware Dynamic Time Synchronization in Parallel Discrete Event Simulation. SIGSIM-PADS 2021: 95-105 - [c106]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Threshold-Based Quantum Optimization. QCE 2021: 137-147 - [c105]Elijah Pelofske, John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Sampling on NISQ Devices: "Who's the Fairest One of All?". QCE 2021: 207-217 - [c104]Yehia Arafa, Abdel-Hameed A. Badawy, Ammar ElWazir, Atanu Barai, Ali Eker, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
Hybrid, scalable, trace-driven performance modeling of GPGPUs. SC 2021: 53 - [i16]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
QAOA-based Fair Sampling on NISQ Devices. CoRR abs/2101.03258 (2021) - [i15]Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Abdel-Hameed A. Badawy, Yehia Arafa, Stephan J. Eidenbenz:
PPT-SASMM: Scalable Analytical Shared Memory Model: Predicting the Performance of Multicore Caches from a Single-Threaded Execution Trace. CoRR abs/2103.10635 (2021) - [i14]Atanu Barai, Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
PPT-Multicore: Performance Prediction of OpenMP applications using Reuse Profiles and Analytical Modeling. CoRR abs/2104.05102 (2021) - [i13]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Threshold-Based Quantum Optimization. CoRR abs/2106.13860 (2021) - [i12]Elijah Pelofske, John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Sampling on NISQ Devices: "Who's the Fairest One of All?". CoRR abs/2107.06468 (2021) - [i11]Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
A Divide-and-Conquer Approach to Dicke State Preparation. CoRR abs/2112.12435 (2021) - 2020
- [j28]Poornima Haridas, Gopinath Chennupati, Nandakishore Santhi, Phillip Romero, Stephan J. Eidenbenz:
Code Characterization With Graph Convolutions and Capsule Networks. IEEE Access 8: 136307-136315 (2020) - [c103]Yehia Arafa, Ammar ElWazir, Abdelrahman Elkanishy, Youssef Aly, Ayatelrahman Elsayed, Abdel-Hameed A. Badawy, Gopinath Chennupati, Stephan J. Eidenbenz, Nandakishore Santhi:
Verified instruction-level energy consumption measurement for NVIDIA GPUs. CF 2020: 60-70 - [c102]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Atanu Barai, Nandakishore Santhi, Stephan J. Eidenbenz:
Fast, accurate, and scalable memory modeling of GPGPUs using reuse profiles. ICS 2020: 31:1-31:12 - [c101]Yehia Arafa, Ammar ElWazir, Abdelrahman Elkanishy, Youssef Aly, Ayatelrahman Elsayed, Abdel-Hameed A. Badawy, Gopinath Chennupati, Stephan J. Eidenbenz, Nandakishore Santhi:
NVIDIA GPGPUs Instructions Energy Consumption. ISPASS 2020: 110-112 - [c100]Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Abdel-Hameed A. Badawy, Yehia Arafa, Stephan J. Eidenbenz:
PPT-SASMM: Scalable Analytical Shared Memory Model: Predicting the Performance of Multicore Caches from a Single-Threaded Execution Trace. MEMSYS 2020: 341-351 - [c99]Andreas Bärtschi, Stephan J. Eidenbenz:
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. QCE 2020: 72-82 - [c98]Jeremy Cook, Stephan J. Eidenbenz, Andreas Bärtschi:
The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover. QCE 2020: 83-92 - [c97]Stefanie Zbinden, Andreas Bärtschi, Hristo N. Djidjev, Stephan J. Eidenbenz:
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. ISC 2020: 187-206 - [i10]Yehia Arafa, Ammar ElWazir, Abdelrahman Elkanishy, Youssef Aly, Ayatelrahman Elsayed, Abdel-Hameed A. Badawy, Gopinath Chennupati, Stephan J. Eidenbenz, Nandakishore Santhi:
Verified Instruction-Level Energy Consumption Measurement for NVIDIA GPUs. CoRR abs/2002.07795 (2020) - [i9]Andreas Bärtschi, Stephan J. Eidenbenz:
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. CoRR abs/2006.00354 (2020) - [i8]Gopinath Chennupati, Nandakishore Santhi, Phillip Romero, Stephan J. Eidenbenz:
Machine Learning Enabled Scalable Performance Prediction of Scientific Codes. CoRR abs/2010.04212 (2020)
2010 – 2019
- 2019
- [j27]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. Algorithmica 81(5): 1938-1964 (2019) - [j26]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
PPT-GPU: Scalable GPU Performance Modeling. IEEE Comput. Archit. Lett. 18: 55-58 (2019) - [c96]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
POSTER: GPUs Pipeline Latency Analysis. ASAP 2019: 139 - [c95]Andreas Bärtschi, Stephan J. Eidenbenz:
Deterministic Preparation of Dicke States. FCT 2019: 126-139 - [c94]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
Low Overhead Instruction Latency Characterization for NVIDIA GPGPUs. HPEC 2019: 1-8 - [c93]Yehia Arafa, Gopinath Chennupati, Atanu Barai, Abdel-Hameed A. Badawy, Nandakishore Santhi, Stephan J. Eidenbenz:
GPUs Cache Performance Estimation using Reuse Distance Analysis. IPCCC 2019: 1-8 - [c92]Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
Scalable Performance Prediction of Codes with Memory Hierarchy and Pipelines. SIGSIM-PADS 2019: 13-24 - [i7]Carleton Coffrin, James Arnold, Stephan J. Eidenbenz, Derek Aberle, John Ambrosiano, Zachary K. Baker, Sara Brambilla, Michael J. Brown, K. Nolan Carter, Pinghan Chu, Patrick Conry, Keeley Costigan, Ariane Eberhardt, David M. Fobes, Adam Gausmann, Sean N. Harris, Donovan Heimer, Marlin Holmes, Bill Junor, Csaba Kiss, Steve Linger, Rodman R. Linn, Li-Ta Lo, Jonathan MacCarthy, Omar Marcillo, Clay McGinnis, Alexander McQuarters, Eric Michalak, Arvind Mohan, Matt Nelson, Diane Oyen, Nidhi Parikh, Donatella Pasqualini, Aaron S. Pope, Reid B. Porter, Chris Rawlings, Hannah Reinbolt, Reid D. Rivenburgh, Philip Romero, Kevin Schoonover, Alexei N. Skurikhin, Daniel R. Tauritz, Dima Tretiak, Zhehui Wang, James Wernicke, Brad Wolfe, Phillip Wolfram, Jonathan Woodring:
The ISTI Rapid Response on Exploring Cloud Computing 2018. CoRR abs/1901.01331 (2019) - [i6]Andreas Bärtschi, Stephan J. Eidenbenz:
Deterministic Preparation of Dicke States. CoRR abs/1904.07358 (2019) - [i5]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
Instructions' Latencies Characterization for NVIDIA GPGPUs. CoRR abs/1905.08778 (2019) - [i4]Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance. CoRR abs/1907.12666 (2019) - 2018
- [c91]Yehia Arafa, Abdel-Hameed A. Badawy, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
PPT-GPU: performance prediction toolkit for GPUs identifying the impact of caches: extended abstract. MEMSYS 2018: 301-302 - [c90]Patrick Crawford, Peter D. Barnes Jr., Stephan J. Eidenbenz, Philip A. Wilsey:
Sampling Simulation Model Profile Data for Analysis. SIGSIM-PADS 2018: 17-28 - [c89]Mohammad Abu Obaida, Jason Liu, Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz:
Parallel Application Performance Prediction Using Analysis Based Models and HPC Simulations. SIGSIM-PADS 2018: 49-59 - [c88]Gopinath Chennupati, Stephan J. Eidenbenz, Alex Long, Olena Tkachenko, Joseph Zerr, Jason Liu:
Imcsim: Parameterized Performance Prediction for Implicit Monte Carlo codes. WSC 2018: 491-502 - [c87]Christopher Hannon, Dong Jin, Nandakishore Santhi, Stephan J. Eidenbenz, Jason Liu:
Just-in-Time Parallel simulation. WSC 2018: 640-651 - [p3]Gopinath Chennupati, R. Muhammad Atif Azad, Conor Ryan, Stephan J. Eidenbenz, Nandakishore Santhi:
Synthesis of Parallel Programs on Multi-Cores. Handbook of Grammatical Evolution 2018: 289-315 - [i3]Patrick J. Coles, Stephan J. Eidenbenz, Scott Pakin, Adetokunbo Adedoyin, John Ambrosiano, Petr M. Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo N. Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin, Andrey Y. Lokhov, Alexander Malyzhenkov, David Dennis Lee Mascarenas, Susan M. Mniszewski, Balu Nadiga, Dan O'Malley, Diane Oyen, Lakshman Prasad, Randy Roberts, Philip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter Swart, Marc Vuffray, Jim Wendelberger, Boram Yoon, Richard J. Zamora, Wei Zhu:
Quantum Algorithm Implementations for Beginners. CoRR abs/1804.03719 (2018) - 2017
- [c86]Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz, Sunil Thulasidasan:
AMM: Scalable Memory Reuse Model to Predict the Performance of Physics Codes. CLUSTER 2017: 649-650 - [c85]Bhargava Kalla, Nandakishore Santhi, Abdel-Hameed A. Badawy, Gopinath Chennupati, Stephan J. Eidenbenz:
A Probabilistic Monte Carlo Framework for Branch Prediction. CLUSTER 2017: 651-652 - [c84]Bhargava Kalla, Nandakishore Santhi, Abdel-Hameed A. Badawy, Gopinath Chennupati, Stephan J. Eidenbenz:
Probabilistic Monte Carlo simulations for static branch prediction. IPCCC 2017: 1-4 - [c83]Gopinath Chennupati, Nandakishore Santhi, Robert F. Bird, Sunil Thulasidasan, Abdel-Hameed A. Badawy, Satyajayant Misra, Stephan J. Eidenbenz:
A Scalable Analytical Memory Model for CPU Performance Prediction. PMBS@SC 2017: 114-135 - [c82]Kishwar Ahmed, Jason Liu, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
A brief history of HPC simulation and future challenges. WSC 2017: 419-430 - [c81]Gopinath Chennupati, Nandakishore Santhi, Stephan J. Eidenbenz, Sunil Thulasidasan:
An analytical memory hierarchy model for performance prediction. WSC 2017: 908-919 - [c80]Patrick Crawford, Stephan J. Eidenbenz, Peter D. Barnes Jr., Philip A. Wilsey:
Some properties of communication behaviors in discrete-event simulation models. WSC 2017: 1025-1036 - 2016
- [j25]Richard J. Zamora, Arthur F. Voter, Danny Perez, Nandakishore Santhi, Susan M. Mniszewski, Sunil Thulasidasan, Stephan J. Eidenbenz:
Discrete event performance prediction of speculatively parallel temperature-accelerated dynamics. Simul. 92(12): 1065-1086 (2016) - [j24]Guillaume Chapuis, Stephan J. Eidenbenz, Nandakishore Santhi:
GPU Performance Prediction Through Parallel Discrete Event Simulation and Common Sense. EAI Endorsed Trans. Ubiquitous Environ. 3(10): e4 (2016) - [c79]Kishwar Ahmed, Jason Liu, Stephan J. Eidenbenz, Joe Zerr:
Scalable Interconnection Network Models for Rapid Performance Prediction of HPC Applications. HPCC/SmartCity/DSS 2016: 1069-1078 - [c78]Kishwar Ahmed, Mohammad Obaida, Jason Liu, Stephan J. Eidenbenz, Nandakishore Santhi, Guillaume Chapuis:
An Integrated Interconnection Network Model for Large-Scale Performance Prediction. SIGSIM-PADS 2016: 177-187 - [c77]Qiang Guan, Nathan DeBardeleben, Panruo Wu, Stephan J. Eidenbenz, Sean Blanchard, Laura Monroe, Elisabeth Baseman, Li Tan:
Design, Use and Evaluation of P-FSEFI: A Parallel Soft Error Fault Injection Framework for Emulating Soft Errors in Parallel Applications. SimuTools 2016: 9-17 - [c76]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. SWAT 2016: 21:1-21:15 - [c75]Guillaume Chapuis, David Nicholaeff, Stephan J. Eidenbenz, Robert S. Pavel:
Predicting performance of Smoothed Particle Hydrodynamics codes at large scales. WSC 2016: 1825-1835 - [i2]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. CoRR abs/1604.05172 (2016) - 2015
- [j23]Susan M. Mniszewski, Christoph Junghans, Arthur F. Voter, Danny Perez, Stephan J. Eidenbenz:
TADSim: Discrete Event-Based Performance Prediction for Temperature-Accelerated Dynamics. ACM Trans. Model. Comput. Simul. 25(3): 15:1-15:26 (2015) - [c74]Guillaume Chapuis, Stephan J. Eidenbenz, Nandakishore Santhi, Eunjung Park:
Simian integrated framework for parallel discrete event simulation on GPUs. WSC 2015: 1127-1138 - [c73]Eunjung Park, Stephan J. Eidenbenz, Nandakishore Santhi, Guillaume Chapuis, Bradley W. Settlemyer:
Parameterized benchmarking of parallel discrete event simulation systems: communication, computation, and memory. WSC 2015: 2836-2847 - [c72]Nandakishore Santhi, Stephan J. Eidenbenz, Jason Liu:
The simian concept: parallel discrete event simulation with interpreted languages and just-in-time compilation. WSC 2015: 3013-3024 - 2014
- [c71]Guanhua Yan, Stephan J. Eidenbenz:
Sim-Watchdog: Leveraging Temporal Similarity for Anomaly Detection in Dynamic Graphs. ICDCS 2014: 154-165 - [c70]Sunil Thulasidasan, Lukas Kroc, Stephan J. Eidenbenz:
Developing parallel, discrete event simulations in Python - first results and user experiences with the SimX library. SIMULTECH 2014: 188-194 - [p2]Benjamin H. Sims, Nikolai Sinitsyn, Stephan J. Eidenbenz:
Hierarchical and Matrix Structures in a Large Organizational Email Network: Visualization and Modeling Approaches. Social Network Analysis 2014: 27-43 - [i1]Benjamin H. Sims, Nikolai Sinitsyn, Stephan J. Eidenbenz:
Hierarchical and Matrix Structures in a Large Organizational Email Network: Visualization and Modeling Approaches. CoRR abs/1411.4314 (2014) - 2013
- [j22]Stephan J. Eidenbenz, Madhav V. Marathe, Arunabha Sen:
Editorial for Computer Networks special issue on ''Towards a Science of Cyber Security''. Comput. Networks 57(10): 2119-2120 (2013) - [j21]Md. Sazzadur Rahman, Guanhua Yan, Harsha V. Madhyastha, Michalis Faloutsos, Stephan J. Eidenbenz, Mike Fisk:
iDispatcher: A unified platform for secure planet-scale information dissemination. Peer-to-Peer Netw. Appl. 6(1): 46-60 (2013) - [c69]Benjamin H. Sims, Nikolai Sinitsyn, Stephan J. Eidenbenz:
Visualization and modeling of structural features of a large organizational email network. ASONAM 2013: 787-791 - [c68]Sean Williams, Stephan J. Eidenbenz:
Themis-1: an agent-based model of a modern monetary reserve system. SpringSim (ADS) 2013: 6 - 2012
- [j20]Gentian Jakllari, Stephan J. Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos:
Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Networks. IEEE Trans. Mob. Comput. 11(1): 61-72 (2012) - [j19]Konstantinos Pelechrinis, Guanhua Yan, Stephan J. Eidenbenz, Srikanth V. Krishnamurthy:
Detection of Selfish Manipulation of Carrier Sensing in 802.11 Networks. IEEE Trans. Mob. Comput. 11(7): 1086-1101 (2012) - [c67]Miguel A. Erazo, Ting Li, Jason Liu, Stephan J. Eidenbenz:
Toward comprehensive and accurate simulation performance prediction of parallel file systems. DSN 2012: 1-12 - [c66]Sunil Thulasidasan, Lukas Kroc, Stephan J. Eidenbenz:
SimCore: A Library for Rapid Development of Large Scale Parallel Simulations. SIMULTECH 2012: 71-76 - [c65]Nam P. Nguyen, Guanhua Yan, My T. Thai, Stephan J. Eidenbenz:
Containment of misinformation spread in online social networks. WebSci 2012: 213-222 - [c64]Vladimir Delengov, Yuan Li, Jennifer Thompson, Lukas Kroc, Nandakishore Santhi, Stephan J. Eidenbenz:
Optimization principles for arithmetic functions in hardware-software co-design. WSC 2012: 337:1-337:2 - 2011
- [j18]Sandeep Kakumanu, Stephan J. Eidenbenz, Raghupathy Sivakumar:
Lattice routing: A 4D routing scheme for multiradio multichannel ad hoc networks. Ad Hoc Networks 9(1): 95-107 (2011) - [j17]Guanhua Yan, Duc T. Ha, Stephan J. Eidenbenz:
AntBot: Anti-pollution peer-to-peer botnets. Comput. Networks 55(8): 1941-1956 (2011) - [c63]Guanhua Yan, Guanling Chen, Stephan J. Eidenbenz, Nan Li:
Malware propagation in online social networks: nature, dynamics, and defense implications. AsiaCCS 2011: 196-206 - [c62]Shiva Prasad Kasiviswanathan, Stephan J. Eidenbenz, Guanhua Yan:
Geography-based analysis of the Internet infrastructure. INFOCOM 2011: 131-135 - [c61]Guanhua Yan, Songqing Chen, Stephan J. Eidenbenz:
RatBot: Anti-enumeration Peer-to-Peer Botnets. ISC 2011: 135-151 - [c60]Yuanyuan Zeng, Guanhua Yan, Stephan J. Eidenbenz, Kang G. Shin:
Measuring the effectiveness of infrastructure-level detection of large-scale botnets. IWQoS 2011: 1-9 - [c59]Adam Crume, Carlos Maltzahn, Jason Cope, Sam Lang, Robert B. Ross, Philip H. Carns, Christopher D. Carothers, Ning Liu, Curtis L. Janssen, John Bent, Stephan J. Eidenbenz, Meghan McClelland:
Poster: FLAMBES: evolving fast performance models. SC Companion 2011: 31-32 - [p1]Peter Widmayer, Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters:
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 85-107 - [e3]Jason Liu, Francesco Quaglia, Stephan J. Eidenbenz, Stephen Gilmore:
4th International ICST Conference on Simulation Tools and Techniques, SIMUTools '11, Barcelona, Spain, March 22 - 24, 2011. ICST/ACM 2011, ISBN 978-1-936968-00-8 [contents] - 2010
- [j16]Guanhua Yan, Stephan J. Eidenbenz, Sunil Thulasidasan, Pallab Datta, Venkatesh Ramaswamy:
Criticality analysis of Internet infrastructure. Comput. Networks 54(7): 1169-1182 (2010) - [c58]Sunil Thulasidasan, Shiva Prasad Kasiviswanathan, Stephan J. Eidenbenz, Philip Romero:
Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations. PADS 2010: 150-157 - [c57]Nandakishore Santhi, Guanhua Yan, Stephan J. Eidenbenz:
CyberSim: Geographic, temporal, and organizational dynamics of malware propagation. WSC 2010: 2876-2887
2000 – 2009
- 2009
- [j15]Stephan J. Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus, Sarvesh Kumar Varatharajan:
Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks. Algorithms 2(4): 1303-1326 (2009) - [j14]Guanhua Yan, Stephan J. Eidenbenz:
Modeling Propagation Dynamics of Bluetooth Worms (Extended Version). IEEE Trans. Mob. Comput. 8(3): 353-368 (2009) - [c56]Duc T. Ha, Guanhua Yan, Stephan J. Eidenbenz, Hung Q. Ngo:
On the effectiveness of structural detection and defense against P2P-based botnets. DSN 2009: 297-306 - [c55]Guanhua Yan, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner:
Blue-Watchdog: Detecting Bluetooth worm propagation in public areas. DSN 2009: 317-326 - [c54]Sunil Thulasidasan, Shiva Prasad Kasiviswanathan, Stephan J. Eidenbenz, Emanuele Galli, Susan M. Mniszewski, Philip Romero:
Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator. HiPC 2009: 428-437 - [c53]Konstantinos Pelechrinis, Guanhua Yan, Stephan J. Eidenbenz, Srikanth V. Krishnamurthy:
Detecting Selfish Exploitation of Carrier Sensing in 802.11 Networks. INFOCOM 2009: 657-665 - [c52]Stephan J. Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus:
On a locally minimum cost forwarding game. FOWANC@MobiHoc 2009: 29-36 - [c51]Guanhua Yan, Stephan J. Eidenbenz, Emanuele Galli:
SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection. RAID 2009: 202-223 - [c50]Russell Bent, Stephan J. Eidenbenz, Sunil Thulasidasan:
Large-scale telephone network simulation: discrete event vs. steady state. SpringSim 2009 - [c49]Emanuele Galli, Leticia Cuellar, Stephan J. Eidenbenz, Mary Ewers, Sue Mniszewski, Christof Teuscher:
ActivitySim: large-scale agent-based activity generation for infrastructure simulation. SpringSim 2009 - [c48]Guanhua Yan, Stephan J. Eidenbenz, Bo Sun:
Mobi-watchdog: you can steal, but you can't run! WISEC 2009: 139-150 - [c47]Sunil Thulasidasan, Stephan J. Eidenbenz:
Accelerating Traffic Microsimulations: A Parallel Discrete-event Queue-based Approach for Speed and Scale. WSC 2009: 2457-2466 - [c46]Lukas Kroc, Stephan J. Eidenbenz, James P. Smith:
SessionSim: Activity-Based Session Generation for Network Simulation. WSC 2009: 3169-3180 - 2008
- [j13]Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude:
On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14(3): 151-172 (2008) - [j12]Stephan J. Eidenbenz, Giovanni Resta, Paolo Santi:
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes. IEEE Trans. Mob. Comput. 7(1): 19-33 (2008) - [c45]Hector D. Flores, Rudolf H. Riedi, Stephan J. Eidenbenz, Nicolas W. Hengartner:
On the Impact of Realism of Mobility Models for Wireless Networks. GLOBECOM 2008: 784-789 - [c44]Gentian Jakllari, Stephan J. Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos:
Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Network. INFOCOM 2008: 744-752 - [c43]Guanhua Yan, Songqing Chen, Stephan J. Eidenbenz:
Dynamic Balancing of Packet Filtering Workloads on Distributed Firewalls. IWQoS 2008: 209-218 - [c42]Gustavo Marfia, Paolo Lutterotti, Stephan J. Eidenbenz, Giovanni Pau, Mario Gerla:
FairCast: fair multi-media streaming in ad hoc networks through local congestion control. MSWiM 2008: 2-9 - [c41]Guanhua Yan, Stephan J. Eidenbenz:
DDoS Mitigation in Non-cooperative Environments. Networking 2008: 599-611 - [c40]Guanhua Yan, Zhen Xiao, Stephan J. Eidenbenz:
Catching Instant Messaging Worms with Change-Point Detection Techniques. LEET 2008 - 2007
- [j11]Stephan J. Eidenbenz, Anders A. Hansson, Venkatesh Ramaswamy, Christian M. Reidys:
On a New Class of Load Balancing Network Protocols. Adv. Complex Syst. 10(3): 359-377 (2007) - [c39]Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters, Peter Widmayer:
Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS 2007: 58-70 - [c38]Guanhua Yan, Hector D. Flores, Leticia Cuellar, Nicolas W. Hengartner, Stephan J. Eidenbenz, Vincent Q. Vu:
Bluetooth worm propagation: mobility pattern matters! AsiaCCS 2007: 32-44 - [c37]Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner:
Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic. GLOBECOM 2007: 2740-2745 - [c36]Stephan J. Eidenbenz, Luzi Anderegg, Roger Wattenhofer:
Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. HICSS 2007: 293 - [c35]Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner:
Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue Management. ICC 2007: 569-574 - [c34]Guanhua Yan, Stephan J. Eidenbenz:
Modeling Propagation Dynamics of Bluetooth Worms. ICDCS 2007: 42 - [c33]Matt S. Nassr, Jangeun Jun, Stephan J. Eidenbenz, Anders A. Hansson, Angela M. Mielke:
Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment. INFOCOM 2007: 670-678 - [c32]Gentian Jakllari, Stephan J. Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos:
Revisiting minimum cost reliable routing in wireless mesh networks. MobiCom 2007: 302-305 - [c31]Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber:
Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements. Networking 2007: 855-866 - [c30]Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores, Stephan J. Eidenbenz:
The Optimum Number of OSPF Areas for MANETs. SECON 2007: 451-460 - [c29]Venkatesh Ramaswamy, Anders A. Hansson, Stephan J. Eidenbenz:
COBRA - A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks. WiMob 2007: 62 - 2006
- [j10]Stephan J. Eidenbenz:
Finding minimum hidden guard sets in polygons - tight approximability results. Comput. Geom. 34(2): 49-57 (2006) - [j9]Stephan J. Eidenbenz, V. S. Anil Kumar, Sibylle Zust:
Equilibria in Topology Control Games for Ad Hoc Networks. Mob. Networks Appl. 11(2): 143-159 (2006) - [c28]Guanhua Yan, Stephan J. Eidenbenz:
Bluetooth Worms: Models, Dynamics, and Defense Implications. ACSAC 2006: 245-256 - [c27]Guanhua Yan, Stephan J. Eidenbenz:
Sluggish Calendar Queues for Network Simulation. MASCOTS 2006: 127-136 - [c26]Weizhao Wang, Xiang-Yang Li, Stephan J. Eidenbenz, Yu Wang:
OURS: optimal unicast routing systems in non-cooperative wireless networks. MobiCom 2006: 402-413 - [c25]Karthikeyan Sundaresan, Weizhao Wang, Stephan J. Eidenbenz:
Algorithmic aspects of communication in ad-hoc networks with smart antennas. MobiHoc 2006: 298-309 - [c24]Hector D. Flores, Stephan J. Eidenbenz, Rudolf H. Riedi, Nicolas W. Hengartner:
Describing MANETS: principal component analysis of sparse mobility traces. PE-WASUN 2006: 123-131 - [c23]Roman Waupotitsch, Stephan J. Eidenbenz, James P. Smith, Lukas Kroc:
Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulator. WSC 2006: 2132-2139 - 2005
- [j8]Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger:
Complexity and Approximability of Double Digest. J. Bioinform. Comput. Biol. 3(2): 207-224 (2005) - [j7]Christopher L. Barrett, Stephan J. Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith:
Parametric Probabilistic Routing in Sensor Networks. Mob. Networks Appl. 10(4): 529-544 (2005) - [j6]Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna:
Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3): 361-381 (2005) - [c22]Stephan J. Eidenbenz, Giovanni Resta, Paolo Santi:
COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes. IPDPS 2005 - [c21]Stephan J. Eidenbenz, Lukas Kroc, James P. Smith:
Maneuverable Relays to Improve Energy Efficiency in Sensor Networks. PerCom Workshops 2005: 411-417 - [c20]Christopher L. Barrett, Stephan J. Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith:
Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios. SAC 2005: 1166-1173 - [c19]Stephan J. Eidenbenz:
Los Alamos communication network simulation. WSC 2005: 23 - 2004
- [j5]Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo:
Preface. Theor. Comput. Sci. 312(1): 1-2 (2004) - [c18]Mark Cieliebak, Stephan J. Eidenbenz:
Measurement Errors Make the Partial Digest Problem NP-Hard. LATIN 2004: 379-390 - 2003
- [j4]Stephan J. Eidenbenz, Peter Widmayer:
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32(3): 654-670 (2003) - [c17]Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer:
Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118 - [c16]Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger:
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527 - [c15]Stephan J. Eidenbenz, V. S. Anil Kumar, Sibylle Zust:
Equilibria in topology control games for ad hoc networks. DIALM-POMC 2003: 2-11 - [c14]Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis:
Composing Equipotent Teams. FCT 2003: 98-108 - [c13]Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer:
Flexible Train Rostering. ISAAC 2003: 615-624 - [c12]Luzi Anderegg, Stephan J. Eidenbenz:
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. MobiCom 2003: 245-259 - [c11]Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna:
Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123 - [c10]Christopher L. Barrett, Stephan J. Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith:
Parametric probabilistic sensor network routing. WSNA 2003: 122-131 - 2002
- [j3]Stephan J. Eidenbenz:
Inapproximability of finding maximum hidden sets on polygons and terrains. Comput. Geom. 21(3): 139-153 (2002) - [j2]Stephan J. Eidenbenz:
Approximation algorithms for terrain guarding. Inf. Process. Lett. 82(2): 99-105 (2002) - [c9]Stephan J. Eidenbenz:
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. SWAT 2002: 60-68 - [e2]Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo:
Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Lecture Notes in Computer Science 2380, Springer 2002, ISBN 3-540-43864-5 [contents] - 2001
- [j1]Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001) - [c8]Stephan J. Eidenbenz, Peter Widmayer:
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344 - 2000
- [c7]Stephan J. Eidenbenz, Christoph Stamm:
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. IFIP TCS 2000: 200-212
1990 – 1999
- 1999
- [c6]Stephan J. Eidenbenz:
How Many People Can Hide in a Terrain? ISAAC 1999: 184-194 - [e1]Peter Widmayer, Gabriele Neyer, Stephan J. Eidenbenz:
Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Lecture Notes in Computer Science 1665, Springer 1999, ISBN 3-540-66731-8 [contents] - 1998
- [c5]Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability of some art gallery problems. CCCG 1998 - [c4]Christoph Stamm, Stephan J. Eidenbenz, Renato Pajarola:
A modified longest side bisection triangulation. CCCG 1998 - [c3]Christoph Stamm, Stephan J. Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer:
A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103- - [c2]Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198 - [c1]Stephan J. Eidenbenz:
Inapproximability Results for Guarding Polygons without Holes. ISAAC 1998: 427-436
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-18 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint