Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/ac/cdm2001.bht:"
@inproceedings{DBLP:conf/ac/Aigner01, author = {Martin Aigner}, editor = {Helmut Alt}, title = {Lattice Paths and Determinants}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {1--12}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_1}, doi = {10.1007/3-540-45506-X\_1}, timestamp = {Tue, 14 May 2019 10:00:49 +0200}, biburl = {https://dblp.org/rec/conf/ac/Aigner01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Alt01, author = {Helmut Alt}, editor = {Helmut Alt}, title = {The Nearest Neighbor}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {13--24}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_2}, doi = {10.1007/3-540-45506-X\_2}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Alt01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/GartnerW01, author = {Bernd G{\"{a}}rtner and Emo Welzl}, editor = {Helmut Alt}, title = {Explicit and Implicit Enforcing - Randomized Optimization}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {25--46}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_3}, doi = {10.1007/3-540-45506-X\_3}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/GartnerW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Helleseth01, author = {Tor Helleseth}, editor = {Helmut Alt}, title = {Codes over Z\({}_{\mbox{4}}\)}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {47--55}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_4}, doi = {10.1007/3-540-45506-X\_4}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Helleseth01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Jung01, author = {Heinz Adolf Jung}, editor = {Helmut Alt}, title = {Degree Bounds for Long Paths and Cycles in k-Connected Graphs}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {56--60}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_5}, doi = {10.1007/3-540-45506-X\_5}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Jung01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/MeinelS01, author = {Christoph Meinel and Christian Stangier}, editor = {Helmut Alt}, title = {Data Structures for Boolean Functions}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {61--78}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_6}, doi = {10.1007/3-540-45506-X\_6}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/MeinelS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Mohring01, author = {Rolf H. M{\"{o}}hring}, editor = {Helmut Alt}, title = {Scheduling under Uncertainty: Bounding the Makespan Distribution}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {79--97}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_7}, doi = {10.1007/3-540-45506-X\_7}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Mohring01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/PromelT01, author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and Anusch Taraz}, editor = {Helmut Alt}, title = {Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {98--118}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_8}, doi = {10.1007/3-540-45506-X\_8}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/PromelT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Rote01, author = {G{\"{u}}nter Rote}, editor = {Helmut Alt}, title = {Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {119--135}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_9}, doi = {10.1007/3-540-45506-X\_9}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Rote01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Schulz01, author = {Ralph{-}Hardo Schulz}, editor = {Helmut Alt}, title = {Check Character Systems and Anti-symmetric Mappings}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {136--147}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_10}, doi = {10.1007/3-540-45506-X\_10}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Schulz01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Stroth01, author = {Gernot Stroth}, editor = {Helmut Alt}, title = {Algorithms in Pure Mathematics}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {148--158}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_11}, doi = {10.1007/3-540-45506-X\_11}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Stroth01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ac/Ziegler01, author = {G{\"{u}}nter M. Ziegler}, editor = {Helmut Alt}, title = {Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions}, booktitle = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, pages = {159--172}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X\_12}, doi = {10.1007/3-540-45506-X\_12}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/Ziegler01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ac/2001cdm, editor = {Helmut Alt}, title = {Computational Discrete Mathematics, Advanced Lectures}, series = {Lecture Notes in Computer Science}, volume = {2122}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45506-X}, doi = {10.1007/3-540-45506-X}, isbn = {3-540-42775-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ac/2001cdm.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.