|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8195 occurrences of 3892 keywords
|
|
|
Results
Found 19615 publication records. Showing 19615 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
55 | Yeu-hsiung Liang |
A parsing method on l-1 bounded context parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 18th Annual Southeast Regional Conference, 1980, Tallahassee, Florida, USA, March 24-26, 1980, pp. 88-97, 1980, ACM, 0-89791-014-1. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
Bounded Context Acceptor, Bounded right context, Extended Bounded Context Acceptor, Normal form grammar, pushdown automaton, Parsing, Context free grammar |
47 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. ![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. 211-220, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs |
47 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 210-221, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms |
46 | Ran Duan, Seth Pettie |
Bounded-leg distance and reachability oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 436-445, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
44 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. ![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. 121-127, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure |
44 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
Automated Incremental Synthesis of Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMICS/PDMC ![In: Formal Methods: Applications and Technology, 11th International Workshop, FMICS 2006 and 5th International Workshop PDMC 2006, Bonn, Germany, August 26-27, and August 31, 2006, Revised Selected Papers, pp. 261-276, 2006, Springer, 978-3-540-70951-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bounded liveness, Bounded response, Real-time, Formal methods, Synthesis, Transformation, Timed automata |
43 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth 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. 741-748, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
43 | Wenhui Zhang |
Bounded Semantics of CTL and SAT-Based Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 11th International Conference on Formal Engineering Methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9-12, 2009. Proceedings, pp. 286-305, 2009, Springer, 978-3-642-10372-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | 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 |
|
40 | Xiangyu Luo, Kaile Su, Abdul Sattar 0001, Mark Reynolds 0001 |
Verification of Multi-agent Systems Via Bounded Model Checking. ![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. 69-78, 2006, Springer, 3-540-49787-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
temporal epistemic logic, bounded semantics, multi-agent systems, bounded model checking |
40 | Gabriel Taubin, Fernando Cukierman, Steve Sullivan, Jean Ponce, David J. Kriegman |
Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(3), pp. 287-303, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bounded algebraic curve fitting, model-based computer vision tasks, bounded zero sets, computer vision, geometric models, polynomials, polynomials, matrix algebra, surface fitting, surface fitting, curve fitting, shape descriptors, data sets |
40 | Dino Pedreschi, Salvatore Ruggieri |
Bounded Nondeterminism of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 42(4), pp. 313-343, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
universal termination, bounded nondeterminism, strong termination, logic programming |
39 | Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard |
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(2), pp. 109-156, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Pu Huang, Charlie C. L. Wang |
Volume and complexity bounded simplification of solid model represented by binary space partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 177-182, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
volume bounded, solid model, simplification, binary space partition, complexity bounded |
37 | Salil P. Vadhan |
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 17(1), pp. 43-77, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Everlasting security, Space-bounded adversaries, Averaging samplers, Expander graphs, Extractors, Unconditional security, Bounded-storage model |
36 | Yehuda Afek, Eran Shalom |
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 209-223, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Consensus hierarchy, Common2, Bounded-use, Bounded-size, Long-lived, Fetch&Add, Queues, Stacks, Set, Wait-free, Swap |
36 | Jack Jie Dai |
An Outer-Measure Approach for Resource-Bounded Measure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(1), pp. 64-73, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Carathéodory definition, Computational complexity, Martingale, Resource-bounded measure |
36 | Kun Zhao, Yingjie Tian 0001, Naiyang Deng |
Robust Unsupervised and Semi-supervised Bounded v - Support Vector Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part II, pp. 312-321, 2009, Springer, 978-3-642-01509-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded ?? support vector machines, Robust, Semi-supervised learning, Unsupervised learning, Semi-definite programming |
36 | Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard |
Progress guarantee for parallel programs via bounded lock-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 144-154, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation |
36 | Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier |
Bounded Self-Stabilizing Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 26-50, 1991, Springer, 3-540-56689-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
bounded Petri nets, computational complexity, Self-stabilization |
36 | Jaroslav Nesetril, Patrice Ossona de Mendez |
Linear time low tree-width partitions and algorithmic consequences. ![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. 391-400, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor |
36 | Mohammad Taghi Hajiaghayi, Naomi Nishimura |
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 305-318, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Liam Roditty, Michael Segal 0001 |
On bounded leg shortest paths problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 775-784, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
36 | Orna Kupferman, Moshe Y. Vardi |
On Bounded Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings, pp. 24-38, 2001, Springer, 3-540-42957-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Cheng-Shang Chang, Duan-Shin Lee, Ching-Ming Lien |
Load balanced Birkhoff-von Neumann switches with resequencing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS Perform. Evaluation Rev. ![In: SIGMETRICS Perform. Evaluation Rev. 29(3), pp. 23-24, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Nader H. Bshouty, Yishay Mansour |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 304-311, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constant bounded product distribution, /spl epsiv/-approximation, j-disjoint DNF, bounded term size, learning (artificial intelligence), decision trees, interpolation, interpolation, finite fields, polynomials, decision theory, learning algorithms, learnability, multivariate polynomials, membership queries, bounded degree |
33 | Afrodita Iorgulescu |
Classes of examples of pseudo-MV algebras, pseudo-BL algebras and divisible bounded non-commutative residuated lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 14(4), pp. 313-327, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Pseudo-Wajsberg algebra, Pseudo-BCK algebra, Pseudo-Hájek(pP) algebra, Divisible bounded non-commutative residuated lattice, Divisible bounded pseudo-BCK(pP) lattice, Pseudo-MV algebra, Pseudo-BL algebra |
33 | Moonseong Kim, Gunu Jho, Hyunseung Choo |
Advanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2007, 7th International Conference Beijing, China, May 27-30, 2007, Proceedings, Part I, pp. 668-675, 2007, Springer, 978-3-540-72583-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multicast Routing Algorithm, Delay-Bounded Minimum Steiner Tree (DBMST) Problem and Bounded Shortest Multicast Algorithm (BSMA) |
33 | Xiangyu Luo, Kaile Su, Abdul Sattar 0001, Qingliang Chen, Guanfeng Lv |
Bounded model checking knowledge and branching time in synchronous multi-agent systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands, pp. 1129-1130, 2005, ACM, 1-59593-094-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded semantics, temporal epistemic logic, translation to SAT, bounded model checking |
33 | Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen |
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 117-131, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Edge-valued decision diagrams, Petri net, Formal verification, BDDs, Reachability analysis, Bounded model checking, Asynchronous design, ADDs |
33 | Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry |
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings, pp. 757-772, 2009, Springer, 978-3-642-05088-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scope-bounded checking, computation graph, first-order logic, SAT, Alloy, white-box testing, lightweight formal method |
33 | Joan Gispert, Antoni Torrens |
Boolean representation of bounded BCK-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 12(10), pp. 941-954, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bounded BCK-algebras, Boolean factor elements, Weak Boolean product, Pierce BCK-representation |
33 | Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing Sun 0002 |
Compositional encoding for bounded model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. China ![In: Frontiers Comput. Sci. China 2(4), pp. 368-379, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Communication Sequential Processes (CSP), Linear Temporal Logic (LTL), bounded model checking |
33 | Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing Sun 0002 |
Bounded Model Checking of Compositional Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TASE ![In: Second IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE 2008, June 17-19, 2008, Nanjing, China, pp. 23-30, 2008, IEEE Computer Society, 978-0-7695-3249-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Compositional Processes, Tool, Bounded Model Checking |
33 | Morteza Moniri |
Preservation theorems for bounded formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(1), pp. 9-14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Polynomial induction, Model completeness, Universal theory, Quantifier elimination, Intuitionistic logic, NP, Bounded arithmetic, Polynomial hierarchy, Kripke model |
33 | Kun Zhao, Ying-Jie Tian 0001, Naiyang Deng, Hiroshi Kuwajima, Takashi Washio |
Robust Unsupervised and Semisupervised Bounded C-Support Vector Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 331-336, 2007, IEEE Computer Society, 0-7695-3033-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bounded Support Vector Machines, robust, semi- supervised learning, unsupervised learning, Semi- definite Programming |
33 | Man Ho Au, Qianhong Wu, Willy Susilo, Yi Mu 0001 |
Compact E-Cash from Bounded Accumulator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2007, The Cryptographers' Track at the RSA Conference 2007, San Francisco, CA, USA, February 5-9, 2007, Proceedings, pp. 178-195, 2007, Springer, 3-540-69327-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
compact e-cash, bounded accumulator, bilinear pairings |
33 | Sean Safarpour, Görschwin Fey, Andreas G. Veneris, Rolf Drechsler |
Utilizing don't care states in SAT-based bounded sequential problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 264-269, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
don't care states, unreachable states, satisfiability, bounded model checking, sequential equivalence checking |
33 | Stefan Dziembowski, Ueli M. Maurer |
Optimal Randomizer Efficiency in the Bounded-Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 17(1), pp. 5-26, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Information theory, Unconditional security, One-time pad, Bounded-storage model, Min-entropy |
33 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Match-Bounded String Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 15(3-4), pp. 149-171, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Match-bounded, Termination, Semi-Thue System, String Rewriting System |
33 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized construction of bounded degree and planar spanner for wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, San Diego, CA, USA, September 19, 2003, pp. 59-68, 2003, ACM. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
33 | Wim H. Hesselink |
Progress Under Bounded Fairness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 12(4), pp. 197-207, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture |
33 | R. David, Janusz A. Brzozowski, Helmut Jürgensen |
Testing for Bounded Faults in RAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 10(3), pp. 197-214, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
bounded fault, testing, Markov chain, random test, RAM, test length, deterministic test |
32 | John Watrous |
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 180-187, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
quantum computation, graph connectivity, space-bounded computation |
32 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 137-152, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Jik H. Chang, Oscar H. Ibarra, Michael A. Palis |
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 119-132, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
32 | Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu, Nir Piterman |
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMSB ![In: Formal Methods in Systems Biology, First International Workshop, FMSB 2008, Cambridge, UK, June 4-5, 2008. Proceedings, pp. 17-32, 2008, Springer, 978-3-540-68410-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 125-134, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Conghua Zhou, Decheng Ding |
Improved SAT Based Bounded Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 611-620, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(2), pp. 105-127, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability |
32 | Andrei Voronkov |
Logic Programming with Bounded Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RCLP ![In: Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990 - Second Russian Conference on Logic Programming, St. Petersburg, Russia, September 11-16, 1991, Proceedings, pp. 486-514, 1991, Springer, 3-540-55460-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Joe Kilian |
On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 466-477, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bounded-interaction proofs, bounded-interaction, noninteractive zero-knowledge proofs, committed bits, complexity, cryptographic primitive |
29 | Leszek Aleksander Kolodziejczyk, Neil Thapen |
The Polynomial and Linear Hierarchies in V0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 408-415, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
prefix parity, linear hierarchy, bounded depth circuits, bounded arithmetic |
29 | Gerardo Lamastra, Giuseppe Lipari, Giorgio C. Buttazzo, Antonino Casile, Fabio Conticelli |
HARTIK 3.0: a portable system for developing real-time applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 4th International Workshop on Real-Time Computing Systems and Applications (RTCSA '97), 27-29 October 1997, Taipei, Taiwan, pp. 43-50, 1997, IEEE Computer Society, 0-8186-8073-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
HARTIK 3.0, soft multimedia, Intel 80/spl times/86 processors, DEC Alpha AXP-PCI-33, bounded blocking time, chained blocking, time bounded communication paradigm, distributed systems, embedded systems, predictability, deadlock, timing constraints, portability, toolkit, dynamic scheduling, real-time applications, software portability, microcontrollers, application designer, portable system |
29 | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
Non-interactive Timestamping in the Bounded-Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 22(2), pp. 189-226, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Unbalanced expander graphs, Timestamping, Randomness extractors, Bounded-storage model |
29 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(1), pp. 89-106, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
29 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala |
Analyzing Security Protocols Using Time-Bounded Task-PIOAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 18(1), pp. 111-159, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Time-bounded task-PIOAs, Probabilistic input/output automata, Security protocols, Oblivious transfer |
29 | Zhi-Hong Tao, Conghua Zhou, Zhong Chen, Lifu Wang |
Bounded Model Checking of CTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 22(1), pp. 39-43, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
symbolic model checking, bounded model checking, QBF, CTL* |
29 | Olivier Y. de Vel |
Learning Semi-Structured Document Categorization Using Bounded-Length Spectrum Sub-Sequence Kernels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 13(3), pp. 309-334, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded-length spectrum, support vector machines, kernel, suffix tree, digital forensics, computer forensics, document categorization, Naive Bayes classifier |
29 | Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala |
Bounded Model Checking for Weak Alternating Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 95-108, 2006, Springer, 3-540-37406-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Weak Alternating Büchi Automata, Bounded Model Checking, PSL, NuSMV |
29 | Keijo Heljanko, Tommi A. Junttila, Timo Latvala |
Incremental and Complete Bounded Model Checking for Full PLTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings, pp. 98-111, 2005, Springer, 3-540-27231-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
PLTL, Complete, Bounded Model Checking, Incremental, NuSMV |
29 | Erkay Savas, Berk Sunar |
A Practical and Secure Communication Protocol in the Bounded Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN (2) ![In: Networking - ICN 2005, 4th International Conference on Networking, ReunionIsland, France, April 17-21, 2005, Proceedings, Part II, pp. 707-717, 2005, Springer, 3-540-25338-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyper-encryption, information theoretical security, pervasive networks, Bounded storage model |
29 | Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila |
Simple Is Better: Efficient Bounded Model Checking for Past LTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings, pp. 380-395, 2005, Springer, 3-540-24297-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Past LTL, Bounded Model Checking, NuSMV |
29 | Chris Olston, Jock D. Mackinlay |
Visualizing Data with Bounded Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOVIS ![In: 2002 IEEE Symposium on Information Visualization (InfoVis 2002), 27 October - 1 November 2002, Boston, MA, USA, pp. 37-40, 2002, IEEE Computer Society, 0-7695-1751-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
bounded uncertainty, uncertainty visualization |
29 | Martin Fränzle |
Take It NP-Easy: Bounded Model Construction for Duration Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 245-264, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Discrete-time Duration Calculus, Bounded model construction, Complexity, Model construction |
29 | Raymond Cunningham, Vinny Cahill |
Time bounded medium access control for ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POMC ![In: Proceedings of the 2002 Workshop on Principles of Mobile Computing, POMC 2002, October 30-31, 2002, Toulouse, France, pp. 1-8, 2002, ACM, 1-58113-511-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
mobile ad hoc networks, medium access control, time bounded |
29 | Lu Guoying, Liu Zemin, Zhou Zheng |
Multicast Routing Based on Ant Algorithm for Delay-Bounded and Load-Balancing Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 27th Conference on Local Computer Networks, Tampa, Florida, USA, 8-10 November, 2000, pp. 362-368, 2000, IEEE Computer Society, 0-7695-0912-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
delay-bounded traffic, load-balancing traffic, multicast destinations, ant-network model, OPNET simulation software, congested nodes, packet switched computer communication networks, computer networks, packet switching, multicast routing, telecommunication network routing, real-time communications, multicast communication, telecommunication traffic, ant algorithm |
29 | Doron Drusinsky, David Harel |
On the Power of Bounded Concurrency I: Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(3), pp. 517-539, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bounded cooperative concurrency, statecharts, finite automata, nondeterminism, alternation, succinctness, omega-automata |
29 | Franz-Josef Brandenburg |
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 312-322, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars |
29 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 259-272, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Xianning Li, Xianwei Zhou |
Bounded-Delay, Probability-Based Routing in Intermittently Connected Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 28th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2008 Workshops), 17-20 June 2008, Beijing, China, pp. 210-215, 2008, IEEE Computer Society, 978-0-7695-3173-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Artur Czumaj, Christian Sohler |
On testable properties in bounded degree graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 494-501, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
29 | Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan |
Bounded CCA2-Secure Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings, pp. 502-518, 2007, Springer, 978-3-540-76899-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Ming-Dou Ker, Che-Hao Chuang |
ESD protection circuits with novel MOS-bounded diode structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2002 International Symposium on Circuits and Systems, ISCAS 2002, Scottsdale, Arizona, USA, May 26-29, 2002, pp. 533-536, 2002, IEEE, 0-7803-7448-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings, pp. 209-223, 2000, Springer, 3-540-41237-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 276-287, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008 |
On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 354-364, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Arun Subbiah, Douglas M. Blough |
Distributed Diagnosis in Dynamic Fault Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(5), pp. 453-467, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fault tolerance, synchronous systems, Distributed diagnosis, dynamic failures |
28 | David R. Wood |
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 348-359, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
An exact almost optimal algorithm for target set selection in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 355-362, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing |
26 | Xiang Yu, Ian Li-Jin Thng, Yuming Jiang 0001, Chunming Qiao |
Queueing processes in GPS and PGPS with LRD traffic inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(3), pp. 676-689, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
LRD isolation, Weibull bounded, Weibull bounded burstiness, queueing process, QoS, long range dependent, generalized processor sharing |
26 | Deepak Goyal |
Transformational Derivation of an Improved Alias Analysis Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 18(1-2), pp. 15-49, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
may-alias analysis, dominated convergence, finite differencing, workset algorithm, alias graph, sparse evaluation graph, input-bounded, output-bounded, continuity, pointer analysis, control flow graph |
25 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 285-286, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
25 | Jian Yu, Hui Yang, Chao Yu |
Structural stability and robustness to bounded rationality for non-compact cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 44(1), pp. 149-157, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Robustness, Nash equilibrium, Multiobjective optimization, Fixed point, Bounded rationality, Structural stability |
25 | Eyjolfur Ingi Asgeirsson, Cliff Stein 0001 |
Bounded-space online bin cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 461-474, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bin cover, Bounded-space, Markov chains, Online |
25 | Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro |
A Metric Encoding for Bounded Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings, pp. 741-756, 2009, Springer, 978-3-642-05088-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded model checking, metric temporal logic |
25 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings, pp. 660-675, 2009, Springer, 978-3-642-05088-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded-time recovery, Phased recovery, Fault-tolerance, Real-time, Program transformation, Program synthesis |
25 | Nir Naaman, Raphael Rom |
Average Case Analysis of Bounded Space Bin Packing Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(1), pp. 72-97, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Discrete item size distribution, Bounded space, Algorithms, Bin packing, Average case analysis |
25 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
Masking Faults While Providing Bounded-Time Phased Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2008: Formal Methods, 15th International Symposium on Formal Methods, Turku, Finland, May 26-30, 2008, Proceedings, pp. 374-389, 2008, Springer, 978-3-540-68235-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bounded-time recovery, Phased recovery, Fault-tolerance, Real-time, Formal methods, Synthesis, Transformation |
25 | Arindam Khaled, Bryant A. Julstrom |
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 611-612, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded labels, labeled spanning trees, genetic algorithms, local search, greedy heuristics |
25 | Tobias Schüle, Klaus Schneider 0001 |
Bounded model checking of infinite state systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 30(1), pp. 51-81, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Temporal logic hierarchy, Global model checking, Local model checking, Bounded model checking, Infinite state systems |
25 | Martin Fränzle, Christian Herde |
HySAT: An efficient proof engine for bounded model checking of hybrid systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 30(3), pp. 179-198, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Verification, Hybrid systems, Satisfiability, Decision procedures, Bounded model checking, Infinite-state systems |
25 | Alok Singh 0001, Ashok Kumar Gupta |
Improved heuristics for the bounded-diameter minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(10), pp. 911-921, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm |
25 | Andreas Malcher, Giovanni Pighizzini |
Descriptional Complexity of Bounded Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, pp. 312-323, 2007, Springer, 978-3-540-73207-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
finite-turn pushdown automata, recursive trade-offs, bounded languages, descriptional complexity, automata and formal languages |
25 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(2), pp. 161-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
25 | Fredrik Kuivinen |
Approximability of Bounded Occurrence Max Ones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 622-633, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bounded occurrence, Max Ones, Approximability, Matching, Constraint satisfaction problems |
25 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 249-264, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
25 | Ronny Krashinsky, Hari Balakrishnan |
Minimizing Energy for Wireless Web Access with Bounded Slowdown. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 11(1-2), pp. 135-148, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded slowdown, protocols, Web, wireless, TCP, IEEE 802.11, HTTP, energy saving, power saving |
25 | Sergey Bereg, David G. Kirkpatrick |
Curvature-bounded traversals of narrow corridors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 278-287, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
curvarure-bounded traversals, computational geometry, motion planning |
25 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
On the locality of bounded growth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 60-68, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded growth, distributed algorithms, locality, dominating sets, packing, covering, unit disk graphs, maximal independent set, network decomposition, doubling dimension |
Displaying result #1 - #100 of 19615 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|