|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11526 occurrences of 4704 keywords
|
|
|
Results
Found 29774 publication records. Showing 29763 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
31 | Aseem Agarwal, Vladimir Zolotov, David T. Blaauw |
Statistical timing analysis using bounds and selective enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(9), pp. 1243-1260, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Mohamed Afify, Olivier Siohan, Chin-Hui Lee |
Upper and lower bounds on the mean of noisy speech: application to minimax classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Speech Audio Process. ![In: IEEE Trans. Speech Audio Process. 10(2), pp. 79-88, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula |
Statistical timing analysis using bounds and selective enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Timing Issues in the Specification and Synthesis of Digital Systems ![In: Proceedings of the 8th ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Monterey, California, USA, December 2-3, 2002, pp. 16-21, 2002, ACM, 1-58113-526-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Vitaly Maiorov, Ron Meir |
On the near optimality of the stochastic approximation of smooth functions by neural networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 13(1), pp. 79-103, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
neural networks, lower bounds, upper bounds, stochastic approximation |
30 | Anurag Kumar 0001, Rajeev Shorey |
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(10), pp. 1147-1164, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
stochastic fork-join jobs, probabilistic allocation of tasks, associated random variables, diffusion limits, simulations, scheduling, scheduling, performance evaluation, performance analysis, parallel processing, lower bounds, delays, queueing theory, digital simulation, upper bounds, stochastic processes, multicomputer system, parallel processing system, queueing delays, exact analysis |
30 | Rahul Jain 0001, Hartmut Klauck, Ashwin Nayak 0001 |
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 599-608, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product |
30 | Oliver Kullmann |
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 40(3-4), pp. 303-352, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies |
30 | George S. Avrunin, James C. Corbett, Laura K. Dillon, Jack C. Wileden |
Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(9), pp. 708-719, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
time bound derivation, uniprocessor concurrent systems, concurrent software system, single processor, arbitrary scheduling, integer programming methods, constrained expression toolset, very large state spaces, scheduling, real-time systems, lower bounds, concurrency control, integer programming, systems analysis, upper bounds, timing analysis, concurrent systems, linear inequalities, timing properties, finite state systems, complex real-time systems |
29 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Non-commutative circuits and the sum-of-squares problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 667-676, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, algebraic complexity |
29 | Troy Lee, Adi Shraibman |
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 81-91, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multiparty communication complexity, disjointness, lower bounds |
29 | Christoph Lenzen 0001, Thomas Locher, Roger Wattenhofer |
Tight bounds for clock synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 46-55, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
gradient property, optimal skew bounds, clock synchronization |
29 | Ran Raz |
Elusive functions and lower bounds for arithmetic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 711-720, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity |
29 | Hind Castel, Lynda Mokdad, Nihal Pekergin |
Stochastic Bounds Applied to the End to End QoS in Communication Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2007), October 24-26, 2007, Istanbul, Turkey, pp. 374-380, 2007, IEEE Computer Society, 978-1-4244-1854-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Tandem queueing networks, performance measures bounds, Markov processes, Stochastic comparisons |
29 | José María López, José Luis Díaz, Daniel F. García |
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 28(1), pp. 39-68, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multiprocessor utilization bounds, partitioning, multiprocessor scheduling, earliest deadline first scheduling, bin-packing problem |
29 | Eugene Shragowitz, Habib Youssef, Bing Lu |
Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(1), pp. 5-22, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
duration of activities, scheduling, approximation algorithms, directed acyclic graphs, NP-complete problems, critical path, timing bounds, PERT, slack |
29 | Anna Gál, Adi Rosén |
Lower bounds on the amount of randomness in private computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 659-666, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, randomness, private computation |
29 | Rosario Gennaro, Yael Gertner, Jonathan Katz |
Lower bounds on the efficiency of encryption and digital signature schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 417-425, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, digital signatures, encryption, black-box |
29 | Juan A. Carrasco |
Computationally Efficient and Numerically Stable Reliability Bounds for Repairable Fault-Tolerant Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 51(3), pp. 254-268, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
continuous time Markov models, reliability, randomization, bounds, fault-tolerant systems, repairable systems |
29 | Anna Gál |
A characterization of span program size and improved lower bounds for monotone span programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(4), pp. 277-296, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Span programs, Boolean formula size, secret sharing..¶ Subject classification. 68Q15, lower bounds, 94C10 |
29 | Laura Heinrich-Litan, Paul Molitor |
Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(4), pp. 360-368, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
upper worst case bounds, partial symmetric Boolean functions, Binary decision diagrams, variable ordering |
29 | Christer Berg, Staffan Ulfberg |
Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 8(1), pp. 1-20, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Circuit complexity, monotone circuits |
29 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick |
Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 277-310, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Solitude Verification, anonymous ring, asynchronous unidirectional ring, bit complexity, lower bounds, nondeterminism, Leader Election |
29 | Rakesh M. Verma, I. V. Ramakrishnan |
Optimal Time Bounds for Parallel Term Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings, pp. 694-703, 1988, Springer, 3-540-19343-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
optimal bounds, parallel term matching, complexity |
28 | Pooi Yuen Kam, Rong Li |
Computing and bounding the first-order Marcum Q-function: a geometric approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 56(7), pp. 1101-1110, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Sunil Arya, Theocharis Malamatos, David M. Mount |
On the importance of idempotence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 564-573, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
28 | Marta Jiménez, José M. Llabería, Agustín Fernández |
A Cost-Effective Implementation of Multilevel Tiling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(10), pp. 1006-1020, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multilevel tiling, Compilers, memory hierarchy, loop transformations |
28 | Sudipto Guha, Andrew McGregor 0001 |
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 760-772, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Leigh E. Hodge, Sasthi C. Ghosh 0001, Steve Hurley, Roger M. Whitaker, Stuart M. Allen |
Coverage and service bounds for UMTS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mobility Conference ![In: Proceedings of the 5th International Conference on Mobile Technology, Applications, and Systems, Mobility Conference 2008, Yilan, Taiwan, September 10-12, 2008, pp. 49, 2008, ACM, 978-1-60558-089-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
optimization, tabu search, integer linear programming |
28 | Tzi-cker Chiueh |
Fast Bounds Checking Using Debug Register. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPEAC ![In: High Performance Embedded Architectures and Compilers, Third International Conference, HiPEAC 2008, Göteborg, Sweden, January 27-29, 2008, Proceedings, pp. 99-113, 2008, Springer, 978-3-540-77559-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Pulkit Grover, Ajit Kumar Chaturvedi |
Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(2), pp. 794-804, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Rastislav Bodík, Rajiv Gupta 0001, Vivek Sarkar |
ABCD: eliminating array bounds checks on demand. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vancouver, Britith Columbia, Canada, June 18-21, 2000, pp. 321-333, 2000, ACM, 1-58113-199-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Stephen Cameron, Chee-Keng Yap |
Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 11(1), pp. 12-39, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
representation simplification, robotics, collision detection, solid modeling, Boolean algebra, constructive solid geometry, interference detection |
26 | Luigi Alcuri, Giuseppe Barbera, Giuseppe D'Acquisto |
Service Curve Estimation by Measurement: An Input Output Analysis of a Softswitch Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QoS-IP ![In: Quality of Service in Multiservice IP Networks, Third International Workshop, QoS-IP 2005, Catania, Italy, February 2-4, 2005, Proceedings, pp. 49-60, 2005, Springer, 3-540-24557-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
softswitch model, Network calculus, delay bounds, performance bounds, service curve |
26 | Zhanping Chen, Kaushik Roy 0001, Tan-Li Chou |
Power sensitivity - a new method to estimate power dissipation considering uncertain specifications of primary inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 40-44, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Monte Carlo based approach, maximum bounds, minimum bounds, power dissipation estimation, power sensitivity, primary inputs, signal properties, signal switching, uncertain specifications, logic CAD, CMOS logic circuits, power estimation, CMOS circuits, signal probability, statistical technique |
26 | Sridhar Madala, James B. Sinclair |
Performance of Synchronous Parallel Algorithms with Regular Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(1), pp. 105-116, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
distribution driven simulations, synchronous parallelalgorithms, mean execution time, program-driven simulations, average execution time, multiphasealgorithms, execution time bounds, scheduling, performance evaluation, parallel algorithms, parallel programming, upper bounds, bounding, scheduling policies, partitioning algorithm, parallel tasks, asymptotic approximations, regular structures |
26 | Rahul Santhanam |
Circuit lower bounds for Merlin-Arthur classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 275-283, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Merlin-Arthur games, average-case lower bounds, circuit lower bounds, advice, pseudo-random generators |
26 | Roberto Montemanni |
Upper and lower bounds for the fixed spectrum frequency assignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(3), pp. 257-260, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Radio frequency assignment, fixed spectrum, lower bounds, upper bounds |
26 | Paul Beame, Toniann Pitassi |
Simplified and Improved Resolution Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 274-282, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle |
26 | Philip J. Bernhard |
Bounds on the Performance of Message Routing Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(10), pp. 1253-1256, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
message routing heuristics, communication conflicts, minimum round partitioning problem, performance evaluation, performance, computational complexity, heuristics, lower bounds, message passing, multiprocessor interconnection networks, upper bounds, network routing, omega network, message patterns, conflict-free |
26 | Jeff Erickson 0001, Raimund Seidel |
Better Lower Bounds on Detecting Affine and Spherical Degeneracies ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 528-536, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
affine detection, spherical degeneracies, sidedness queries, common hyperplane, computational geometry, lower bounds, lower bound, upper bounds, point set |
26 | Jaikumar Radhakrishnan |
Better Bounds for Threshold Formulas ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 314-323, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
stronger monotone contact networks model, better bounds, nearly optimal bounds, threshold formulas, monotone formula, computation, threshold functions |
26 | Andrew Chi-Chih Yao |
Lower Bounds for Algebraic Computation Trees with Integer Inputs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 308-313, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
integer inputs, topological lower bound, algebraic computation tree model, integral-constrained form, element distinctness, set disjointness, integer max gap, Milnor-Thom techniques, lower bounds, upper bounds, convex hull, Betti numbers, algebraic varieties, algebraic computation trees |
26 | Andrei Z. Broder, Anna R. Karlin |
Bounds on the Cover Time (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 479-487, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
regular expander graphs, connected unidirected graph, lower bounds, Markov chain, random walk, upper bounds, eigenvalues, vertices, particle, cover time, neighbors |
26 | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
Dynamic Perfect Hashing: Upper and Lower Bounds ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 524-531, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem |
26 | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 568-579, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
combinatorial complexity bounds, incidence counting, many-faces problem, pseudolines, unit circles, general circles, pseudocircles, three-dimensional unit-distance problem, upper bounds, surfaces, curves, lines, three dimensions, spheres |
26 | Prithviraj Banerjee, Jacob A. Abraham |
Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 35(4), pp. 296-306, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
system-level faults, lower bounds, linear programming, fault detection, upper bounds, errors, fault location, graph model, Checks |
26 | Utpal Banerjee, Shyh-Ching Chen, David J. Kuck, Ross A. Towle |
Time and Parallel Processor Bounds for Fortran-Like Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(9), pp. 660-670, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
Analysis of programs, Fortran-like loops, processor bounds, program speedup, parallel computation, data dependence, time bounds, recurrence relations |
26 | Shyh-Ching Chen, David J. Kuck |
Combinational Circuit Synthesis with Time and Component Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 26(8), pp. 712-726, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
component bounds, sequential circuits, combinational circuits, time bounds, circuit synthesis, Binary addition, binary multiplication |
26 | Yves Younan, Pieter Philippaerts, Lorenzo Cavallaro, R. Sekar 0001, Frank Piessens, Wouter Joosen |
PAriCheck: an efficient pointer arithmetic checker for C programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010, Beijing, China, April 13-16, 2010, pp. 145-156, 2010, ACM, 978-1-60558-936-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
bounds checking, buffer overflows |
26 | Takayuki Osogami, Rudy Raymond |
Semidefinite optimization for transient analysis of queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010, pp. 363-364, 2010, ACM, 978-1-4503-0038-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
occupation measure, semidefinite programming, duality, bounds, moments, transient, g/g/1 queue |
26 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman |
The complexity of synchronous iterative Do-All with crashes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 17(1), pp. 47-63, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Distributed algorithms, Lower bounds, Work complexity |
26 | Brian King |
Requirements for Group Independent Linear Threshold Secret Sharing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 7th Australian Conference, ACISP 2002, Melbourne, Australia, July 3-5, 2002, Proceedings, pp. 89-106, 2002, Springer, 3-540-43861-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
linear secret sharing, group independent linear threshold schemes, monotone span programs and bounds on share size, secret sharing, threshold cryptography |
26 | Yves Dallery, Rajan Suri |
Approximate Disaggregation and Performance Bound for Queueing Networks with Multiple-Server Stations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation, North Carolina, State University, USA, May 28-30, 1986, pp. 111-128, 1986, ACM, 0-89791-184-9. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
approximate disaggregation, performance bounds, closed queueing networks, product form networks |
26 | Sunil Arya, David M. Mount, Jian Xia |
Tight lower bounds for halfspace range searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 29-37, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, range searching, idempotence |
26 | Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet |
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 79-81, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
communication bounds, sparse Cholesky |
26 | Alexander A. Sherstov |
The pattern matrix method for lower bounds on quantum communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 85-94, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximate degree of boolean functions, bounded-error communication, quantum communication complexity, lower bounds |
26 | Gopal Pandurangan, Eli Upfal |
Entropy-based bounds for online algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(1), pp. 7:1-7:19, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
list accessing, caching, entropy, prefetching, Online algorithms, stochastic process, performance bounds |
26 | Maurice J. Jansen, Kenneth W. Regan |
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 470-481, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives |
26 | Sing-Kong Cheung, Hans van den Berg, Richard J. Boucherie |
Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 53(1-2), pp. 7-18, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
M/G/1 PS, Conditional sojourn time, Insensitive bounds, Instantaneous sojourn time, Euler's number triangle, Moment ordering, Permanent customers, Moments |
26 | Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas |
Time-space lower bounds for satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(6), pp. 835-865, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Complexity of satisfiability, time-space lower bounds |
26 | Liana Stanescu, Dumitru Dan Burdescu, Cosmin Stoica Spahiu |
Using R-Trees in Content-Based Region Query with Spatial Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 25-29 September 2005, Timisoara, Romania, pp. 83-89, 2005, IEEE Computer Society, 0-7695-2453-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
content-based region query, spatial bounds, absolute localization, minimal bounding rectangle, R trees, spatial indexing |
26 | Vineet Bafna, Vikas Bansal 0001 |
The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 1(2), pp. 78-90, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ancestral recombination graph, lower bounds, NP-completeness, Recombination, haplotypes, conflict graph, phylogenetic networks |
26 | Thomas Bonald, Alexandre Proutière |
On Stochastic Bounds for Monotonic Processor Sharing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 47(1-2), pp. 81-106, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
processor sharing networks, stochastic bounds, monotonicity, balance, insensitivity |
26 | Thierry Benoist, Benoît Rottembourg |
Upper bounds for revenue maximization in a satellite scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 2(3), pp. 235-249, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
concave costs, Russian Dolls, Upper bounds, valid inequalities |
26 | Peter Bürgisser, Martin Lotz |
Lower bounds on the bounded coefficient complexity of bilinear maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(3), pp. 464-482, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bilinear circuits, lower bounds, Algebraic complexity, singular values |
26 | Michel Vasquez, Jin-Kao Hao |
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(1), pp. 87-103, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
partition, tabu search, bounds, constraint relaxation, branch & bound |
26 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing polynomial identity tests means proving circuit lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 355-364, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing |
26 | Brian M. Sadler, Richard J. Kozick, Terrence J. Moore, Ananthram Swami |
Bounds on SIMO and MIMO Channel Estimation and Equalization with Side Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 30(1-3), pp. 107-126, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Cramér-Rao bounds, semi-blind, constant modulus, blind estimation, communications, equalization, channel estimation, source separation |
26 | Ricard Gavaldà, Osamu Watanabe 0001 |
Sequential Sampling Algorithms: Unified Analysis and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings, pp. 173-188, 2001, Springer, 3-540-43025-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Data mining, Random sampling, adaptive sampling, sequential sampling, Chernoff bounds |
26 | Tamás Szántai |
Improved Bounds and Simulation Procedures on the Value of the Multivariate Normal Probability Distribution Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 100(1-4), pp. 85-101, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
probability bounds, Monte Carlo simulation, variance |
26 | Víctor Suñé, Juan A. Carrasco |
Failure Distance Based Bounds for Steady-State Availability without the Knowledge of Minimal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: MASCOTS 1999, Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 24-28 October, 1999, College Park, Maryland, USA, pp. 138-147, 1999, IEEE Computer Society, 0-7695-0381-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
steady-state availability, failure distance, bounds, Fault-tolerant systems, continuous-time Markov chains |
26 | Stasys Jukna |
Finite Limits and Monotone Computations: The Lower Bounds Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 302-313, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
real gates, lower bounds, threshold gates, monotone circuits |
26 | Javier Campos, Giovanni Chiola, Manuel Silva Suárez |
Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(2), pp. 117-125, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
persistent nets, throughput bounds, unique consistent firing count vector, mono-T-semiflow net subclasses, incidence matrix, synchronized queuing networks, Petri nets, Petri nets, linear programming, linear programming, ergodicity, marked graphs |
25 | Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 533-542, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function |
25 | Eran Hof, Igal Sason, Shlomo Shamai |
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(3), pp. 977-996, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams |
Optimization of Information Rate Upper and Lower Bounds for Channels With Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(2), pp. 663-688, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ D. Richmond, Arye Nehorai |
A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(11), pp. 5334-5352, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Behzad Sharif, Yoram Bresler |
Upper bounds on aliasing error energy for multidimensional sampling of nonbandlimited signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 3717-3720, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Sang Joon Kim, Patrick Mitran, Vahid Tarokh |
Performance Bounds for Bi-Directional Coded Cooperation Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), June 25-29, 2007, Toronto, Ontario, Canada, pp. 83, 2007, IEEE Computer Society, 0-7695-2881-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Paul Beame, T. S. Jayram, Atri Rudra |
Lower bounds for randomized read/write stream algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 689-698, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
communication complexity, data stream algorithms |
25 | Ehab S. Elmallah, Hosam M. F. AboElFotoh |
Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 55(4), pp. 602-612, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, Björn Lisper |
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 27th IEEE Real-Time Systems Symposium (RTSS 2006), 5-8 December 2006, Rio de Janeiro, Brazil, pp. 57-66, 2006, IEEE Computer Society, 0-7695-2761-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter J. Stuckey |
Finite Domain Bounds Consistency Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2006: Advances in Artificial Intelligence, 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006, Proceedings, pp. 49-58, 2006, Springer, 3-540-49787-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Vineet Bafna, Vikas Bansal 0001 |
Improved Recombination Lower Bounds for Haplotype Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings, pp. 569-584, 2005, Springer, 3-540-25866-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Elizaveta A. Okol'nishnikova |
On Some Bounds on the Size of Branching Programs (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings, pp. 107-115, 2005, Springer, 3-540-29498-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Liam Keliher |
Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AES Conference ![In: Advanced Encryption Standard - AES, 4th International Conference, AES 2004, Bonn, Germany, May 10-12, 2004, Revised Selected and Invited Papers, pp. 42-57, 2004, Springer, 3-540-26557-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
SPN, MELP, MEDP, KMT2, KMT2-DC, AES, provable security, differential cryptanalysis, Rijndael, linear cryptanalysis |
25 | Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey |
Set Bounds and (Split) Set Domain Propagation Using ROBDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings, pp. 706-717, 2004, Springer, 3-540-24059-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Lei Wang 0003, Naresh R. Shanbhag |
Energy-efficiency bounds for deep submicron VLSI systems in the presence of noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 11(2), pp. 254-269, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Mohammed A. Hasan |
Sharper bounds for the zeros of polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, Bangkok, Thailand, May 25-28, 2003, pp. 16-19, 2003, IEEE, 0-7803-7761-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula |
Computation and Refinement of Statistical Bounds on Circuit Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 40th Design Automation Conference, DAC 2003, Anaheim, CA, USA, June 2-6, 2003, pp. 348-353, 2003, ACM, 1-58113-688-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Norbert Sensen |
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 391-403, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
Lower Bounds for Dynamic Algebraic Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 362-372, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Jürg Nievergelt, C. K. Wong |
Upper Bounds for the Total Path Length of Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(1), pp. 1-6, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
25 | John W. Carr III |
Error Bounds for the Runge-Kutta Single-Step Integration Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 5(1), pp. 39-44, 1958. The full citation details ...](Pics/full.jpeg) |
1958 |
DBLP DOI BibTeX RDF |
|
23 | Tamás Szántai |
Approximation of Multivariate Probability Integrals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 83-90, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Boole-Bonferroni bounds, Hunter-Worsley bounds, Probability integrals, Probabilistic constrained stochastic programming, Approximation, Variance reduction |
23 | Shai Shalev-Shwartz, Yoram Singer |
A primal-dual perspective of online learning algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 115-142, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mistake bounds, Regret bounds, Online learning, Duality |
23 | Eric C. R. Hehner |
Formalization of Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 10(3), pp. 290-306, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Average space, Formal methods, Time bounds, Real-time programming, Space bounds |
23 | Riccardo Gusella, Stefano Zatti |
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(7), pp. 847-853, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
TEMPO, Berkeley UNIX 4.3BSD, network transmission latency, VAX computers, lower bounds, fault tolerant computing, Unix, local area network, local area networks, synchronisation, upper bounds, clock synchronization, distributed service |
23 | Sverrir Olafsson, Yaser S. Abu-Mostafa |
The Capacity of Multilevel Threshold Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 10(2), pp. 277-281, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
information capacity, multilevel threshold functions, input set, lower bounds, topology, topology, information theory, information theory, upper bounds |
23 | Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin |
Aggregated bounding Markov processes applied to the analysis of tandem queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VALUETOOLS ![In: Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2007, Nantes, France, October 22-27, 2007, pp. 43, 2007, ICST/ACM, 978-963-9799-00-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
loss probability bounds, tandem queueing networks, Markov processes, stochastic comparisons |
Displaying result #101 - #200 of 29763 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|