Interprocedurally Analyzing Polynomial Identities (Englisch)
- Neue Suche nach: Muller-Olm, M.
- Neue Suche nach: Petter, M.
- Neue Suche nach: Seidl, H.
- Neue Suche nach: Muller-Olm, M.
- Neue Suche nach: Petter, M.
- Neue Suche nach: Seidl, H.
- Neue Suche nach: Durand, Bruno
- Neue Suche nach: Thomas, Wolfgang
In:
Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006 ; proceedings /
3884
;
50-67
;
2006
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:Interprocedurally Analyzing Polynomial Identities
-
Beteiligte:Muller-Olm, M. ( Autor:in ) / Petter, M. ( Autor:in ) / Seidl, H. ( Autor:in ) / Durand, Bruno / Thomas, Wolfgang
-
Kongress:23rd, Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006 ; proceedings / ; 2006 ; Marseilles, France
-
Erschienen in:Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006 ; proceedings / , 3884 ; 50-67LECTURE NOTES IN COMPUTER SCIENCE , 3884 ; 50-67
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin
-
Erscheinungsdatum:01.01.2006
-
Format / Umfang:18 pages
-
Anmerkungen:International conference proceedings. Includes bibliographic references and index.
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
The Ubiquitous Digital TreeFlajolet, P. et al. | 2006
- 23
-
Flat Holonomies on Automata NetworksItkis, G. / Levin, L. A. et al. | 2006
- 50
-
Interprocedurally Analyzing Polynomial IdentitiesMuller-Olm, M. / Petter, M. / Seidl, H. et al. | 2006
- 68
-
External String Sorting: Faster and Cache-ObliviousFagerberg, R. / Pagh, A. / Pagh, R. et al. | 2006
- 80
-
Amortized Rigidness in Dynamic Cartesian TreesBialynicka-Birula, I. / Grossi, R. et al. | 2006
- 92
-
Distribution-Sensitive Construction of Minimum-Redundancy Prefix CodesBelal, A. / Elmasry, A. et al. | 2006
- 104
-
On Critical Exponents in Fixed Points of Binary k-Uniform MorphismsKrieger, D. et al. | 2006
- 115
-
Equivalence of F-Algebras and Cubic FormsAgrawal, M. / Saxena, N. et al. | 2006
- 127
-
Complete Codes in a Sofic ShiftBeal, M.-P. / Perrin, D. et al. | 2006
- 137
-
Kolmogorov Complexity with ErrorFortnow, L. / Lee, T. / Vereshchagin, N. et al. | 2006
- 149
-
Kolmogorov Complexity and the Recursion TheoremKjos-Hanssen, B. / Merkle, W. / Stephan, F. et al. | 2006
- 162
-
Entanglement in Interactive Proof Systems with Binary AnswersWehner, S. et al. | 2006
- 172
-
Quantum Algorithms for Matching and Network FlowsAmbainis, A. / Spalek, R. et al. | 2006
- 184
-
The Number of Runs in a String: Improved Analysis of the Linear Upper BoundRytter, W. et al. | 2006
- 196
-
Estimating Entropy and Entropy Norm on Data StreamsChakrabarti, A. / Do Ba, K. / Muthukrishnan, S. et al. | 2006
- 206
-
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path ProblemsGolovin, D. / Goyal, V. / Ravi, R. et al. | 2006
- 218
-
Exact Price of Anarchy for Polynomial Congestion GamesAland, S. / Dumrauf, D. / Gairing, M. / Monien, B. / Schoppmann, F. et al. | 2006
- 230
-
Oblivious Symmetric AlternationChakaravarthy, V. T. / Roy, S. et al. | 2006
- 242
-
Combining Multiple HeuristicsSayag, T. / Fine, S. / Mansour, Y. et al. | 2006
- 254
-
Conflict-Free Colorings of Rectangles RangesElbassioni, K. / Mustafa, N. H. et al. | 2006
- 264
-
Grid Vertex-Unfolding Orthogonal PolyhedraDamian, M. / Flatland, R. / O Rourke, J. et al. | 2006
- 277
-
Theory and Application of Width Bounded Geometric SeparatorFu, B. et al. | 2006
- 289
-
Invariants of Automatic Presentations and Semi-synchronous TransductionsBarany, V. et al. | 2006
- 301
-
On the Accepting Power of 2-Tape Buchi AutomataFinkel, O. et al. | 2006
- 313
-
Weighted Picture Automata and Weighted LogicsMaurer, I. et al. | 2006
- 325
-
Markov Decision Processes with Multiple ObjectivesChatterjee, K. / Majumdar, R. / Henzinger, T. A. et al. | 2006
- 337
-
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing MechanismsPenna, P. / Ventre, C. et al. | 2006
- 349
-
Convergence and Approximation in Potential GamesChristodoulou, G. / Mirrokni, V. S. / Sidiropoulos, A. et al. | 2006
- 361
-
Fast FPT-Algorithms for Cleaning GridsDiaz, J. / Thilikos, D. M. et al. | 2006
- 372
-
Tradeoffs in Depth-Two SuperconcentratorsDutta, C. / Radhakrishnan, J. et al. | 2006
- 384
-
On Hypergraph and Graph Isomorphism with Bounded Color ClassesArvind, V. / Kobler, J. et al. | 2006
- 396
-
Forbidden Substrings, Kolmogorov Complexity and Almost Periodic SequencesRumyantsev, A. Y. / Ushakov, M. A. et al. | 2006
- 408
-
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard SetsHitchcock, J. M. et al. | 2006
- 420
-
Regularity Problems for Visibly Pushdown LanguagesBarany, V. / Loding, C. / Serre, O. et al. | 2006
- 432
-
Regular Expressions and NFAs Without epsilon-TransitionsSchnitger, G. et al. | 2006
- 444
-
Redundancy in Complete SetsGlasser, C. / Pavan, A. / Selman, A. L. / Zhang, L. et al. | 2006
- 455
-
Sparse Selfreducible Sets and Polynomial Size Circuit Lower BoundsBuhrman, H. / Torenvliet, L. / Unger, F. et al. | 2006
- 469
-
Linear Advice for Randomized Logarithmic SpaceFortnow, L. / Klivans, A. R. et al. | 2006
- 477
-
Nested Pebbles and Transitive ClosureEngelfriet, J. / Hoogeboom, H. J. et al. | 2006
- 489
-
Definability of Languages by Generalized First-Order Formulas over (N,+)Roy, A. / Straubing, H. et al. | 2006
- 500
-
Generalized Modal SatisfiabilityBauland, M. / Hemaspaandra, E. / Schnoor, H. / Schnoor, I. et al. | 2006
- 512
-
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity GamesChatterjee, K. / Henzinger, T. A. et al. | 2006
- 524
-
DAG-Width and Parity GamesBerwanger, D. / Dawar, A. / Hunter, P. / Kreutzer, S. et al. | 2006
- 537
-
Reliable Computations Based on Locally Decodable CodesRomashchenko, A. et al. | 2006
- 549
-
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and MovementsCohen, R. / Peleg, D. et al. | 2006
- 561
-
A Faster Algorithm for the Steiner Tree ProblemMolle, D. / Richter, S. / Rossmanith, P. et al. | 2006
- 571
-
Generating Randomized Roundings with Cardinality Constraints and DerandomizationsDoerr, B. et al. | 2006
- 584
-
Online Sorting Buffers on LineKhandekar, R. / Pandit, V. et al. | 2006
- 596
-
Optimal Node RoutingAzar, Y. / Chaiutin, Y. et al. | 2006
- 608
-
Memoryless Facility Location in One PassFotakis, D. et al. | 2006
- 621
-
Energy-Efficient Algorithms for Flow Time MinimizationAlbers, S. / Fujiwara, H. et al. | 2006
- 634
-
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic GamesEtessami, K. / Yannakakis, M. et al. | 2006
- 646
-
Datalog and Constraint Satisfaction with Infinite TemplatesBodirsky, M. / Dalmau, V. et al. | 2006
- 660
-
Evaluating Monotone Circuits on Cylinders, Planes and ToriLimaye, N. / Mahajan, M. / Jayalal Sarma, M. N. et al. | 2006
- 672
-
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic TwoHealy, A. / Viola, E. et al. | 2006
- 684
-
Weighted Asynchronous Cellular AutomataKuske, D. et al. | 2006
- 696
-
On the Complexity of the "Most General" Firing Squad Synchronization ProblemGoldstein, D. / Kobayashi, K. et al. | 2006